Strong Password(贪心思想)

合集 - 刷题集(97)
1.妖梦拼木棒2.[USACO1.2]回文平方数 Palindromic Squares3.[COCI2012-2013#1] LJUBOMORA4.火柴棒等式5.Kieszonkowe6.[COCI2014-2015#5] TRAKTOR7.硬币翻转8.[蓝桥杯 2020 省 AB1] 走方格9.P2097 资料分发10.[AHOI2005]约数研究11.[NOIP2004 普及组] 火星人12.我焯,原神(这真是个题)13.滑雪 OJ365114.CV的人有福啦!YTU贪心训练2(部分注释)15.砝码称重16.警钟长鸣-----找零钱17.[USACO09OCT]Barn Echoes G18.【CSGRound2】光骓者的荣耀19.初见蓝桥杯20.[蓝桥杯 2022 省 B] 扫雷21.开餐馆22.P9241 [蓝桥杯 2023 省 B] 飞机降落23.P7083 [NWRRC2013] Energy Tycoon24.高精度25.P7954 [COCI2014-2015#6] PAPRIKA26.(输出路径搜索)[USACO06OCT] Cows on Skates G27.畜栏保留问题28.(贪心+搜索+剪枝)P8801 [蓝桥杯 2022 国 B] 最大数字29.蓝桥杯 入门----普及-30.[NOIP2016 提高组] 玩具谜题31.[NOIP2002 提高组] 字串变换(无向图查重)32.[NOIP2000 提高组] 单词接龙33.POJ 硬币34.动态规划学习 1(最长上升子序列问题)35.动态规划学习 2(背包问题及其变形)36. 切割回文37.[NOIP2001 提高组] 数的划分(剪枝)38.字符串转换数字,sscanf和sprintf大法39.[CTSC1997] 选课(树状DP)40. k 倍区间(同余定理,组合数)41.[蓝桥杯 2018 省 AB] 全球变暖42.马的遍历(对bfs的更深一层探讨)43.找零钱44.Pasha Maximizes45.Newspaper Headline46.Balanced Ternary String47.(数论)素数,质数48.(数论) 约数49.Helping the Nature50.(博弈论)Even Number Addicts51.Present52.Mr. Kitayuta's Colorful Graph(二维并查集,弱化版)53.Edgy Trees(dfs,并查集,快速幂,树形结构,红黑树)54.并查集55.再谈 前缀和,差分,离散化56.Best Cow Fences(前缀和+特殊二分)57.二分58.同类型,类背包动态规划,选地dp59.Primes on Interval(欧拉筛+二分+滑动窗口)60.字符串(KMP , Trie树 , STL)61.Codeforces1 #879 div.262.Add Modulo 10(数论,思维,数学,规律)63.期末考试YTU4035: Shmily(数学,等差数列)64.[POI2006] OKR-Periods of Words65.Getting Zero(Bfs)66.快速幂67.Dreaming of Freedom(数论,贪心)68.Scoring Subsequences69.Dolce Vita70.Cake Assembly Line71.Constructive Problem72.Forever Winter73.Maximum Sum(前缀和)74.Contrast Value(数学规律)75.Lamps(STL+双端队列)76.Long Long77.Sum in Binary Tree78.Apple Tree(树状搜索,树形DP)
79.Strong Password(贪心思想)
80.Come Together81.Notepad82.Hamiltonian Wall83.7.17作业84.逛画展(双指针)85.#88586.树状数组87.Subsequence Addition88.7.22作业89.Diverse Substrings90.Tracking Segments(二分,区间前缀)91.最大食物链计数92.线段树193.[TJOI2007] 线段(状态机)94.#87895.测试196.李白打酒97.砍竹子
收起
Strong Password
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

Monocarp finally got the courage to register on ForceCoders. He came up with a handle but is still thinking about the password.

He wants his password to be as strong as possible, so he came up with the following criteria:

  • the length of the password should be exactly m;
  • the password should only consist of digits from 00 to 99;
  • the password should not appear in the password database (given as a string s) as a subsequence (not necessarily contiguous).

Monocarp also came up with two strings of length m: l and r, both consisting only of digits from 00 to 99. He wants the i-th digit of his password to be between li and ri, inclusive.

Does there exist a password that fits all criteria?

Input

The first line contains a single integer t (1≤t≤1041≤≤104) — the number of testcases.

The first line of each testcase contains a string s (1≤|s|≤3⋅1051≤||≤3⋅105), consisting only of digits from 00 to 99 — the password database.

The second line contains a single integer m (1≤m≤101≤≤10) — the required length of the password.

The third line contains a string l (|l|=m||=), consisting only of digits from 00 to 99 — the lower restriction on each digit.

The fourth line contains a string r (|r|=m||=), consisting only of digits from 00 to 99 — the upper restriction on each digit. li≤ri≤ for all i from 11 to m.

The sum of lengths of s over all testcases doesn't exceed 3⋅1053⋅105.

Output

For each testcase, print "YES" if there exists a password that fits all criteria. Print "NO" otherwise.

Example
input
Copy
5
88005553535123456
2
50
56
123412341234
3
111
444
1234
4
4321
4321
459
2
49
59
00010
2
10
11
output
Copy
YES
NO
YES
NO
YES
Note

In the first testcase, Monocarp can choose password "50". It doesn't appear in s as a subsequence.

In the second testcase, all combinations of three digits, each of them being from 11 to 44, fit the criteria on l and r. However, all of them appear in s as subsequences. For example, "314" appears at positions [3,5,12][3,5,12] and "222" appears at positions [2,6,10][2,6,10].

In the third testcase, Monocarp can choose password "4321". Actually, that is the only password that fits the criteria on l and r. Luckily, it doesn't appear in s as a subsequence.

In the fourth testcase, only "49" and "59" fit the criteria on l and r. Both of them appear in s as subsequences.

In the fifth testcase, Monocarp can choose password "11".

复制代码
//Strong Password
//贪心的想,每次寻找字母都找在字符串中位置最靠后的,这样出现密码的范围才会变小
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N=1e6+10,mod=1e9+7;
int n,t,a[N],f[N],res,num,ans,m;
bool vis[N];
signed main()
{
    std::ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    cin>>t;
    while(t--){
        res=0;
        string s,l,r;
        cin>>s>>n>>l>>r;
        for(int i=0;i<n;i++){
            int pos=0;
            for(int j=l[i];j<=r[i];j++){
                int x=s.find(j,res);//找到这个字母
                if(x==-1){//如果没有,那就直接判断为可以
                    cout<<"YES"<<endl;
                    goto nexts;
                }
                pos=max(pos,x+1);//如果这个数字位置靠后就更新
            }
            res=max(pos,res);//找到目前位数最靠后的数字
        }
        cout<<"NO"<<endl;
        nexts:;
    }
    return 0;
}
复制代码

 

 


__EOF__

本文作者：Sakurajimamai
本文链接：https://www.cnblogs.com/o-Sakurajimamai-o/p/17547698.html
关于博主：评论和私信会在第一时间回复。或者直接私信我。
版权声明：本博客所有文章除特别声明外，均采用 BY-NC-SA 许可协议。转载请注明出处！
声援博主：如果您觉得文章对您有帮助，可以点击文章右下角【推荐】一下。您的鼓励是博主的最大动力！
posted @   o-Sakurajimamai-o  阅读(64)  评论(0)  编辑  收藏  举报
相关博文：
·  Dreaming of Freedom(数论,贪心)
·  Notepad
·  Educational Codeforces Round 151 (Rated for Div. 2) C. Strong Password
·  Educational 151 DIV2 T3 strong password
·  [LeetCode] 2299. Strong Password Checker II
阅读排行：
· winform 绘制太阳，地球，月球 运作规律
· AI与.NET技术实操系列（五）：向量存储与相似性搜索在 .NET 中的实现
· 超详细：普通电脑也行Windows部署deepseek R1训练数据并当服务器共享给他人
· 【硬核科普】Trae如何「偷看」你的代码？零基础破解AI编程运行原理
· 上周热点回顾（3.3-3.9）
-- --
点击右上角即可分享
微信分享提示