月月查华华的手机

月月查华华的手机

// Problem: 月月查华华的手机// Contest: NowCoder// URL: Memory Limit: 524288 MB// Time Limit: 4000 ms// 2022-03-08 21:05:24// // Powered by CP Editor (namespace std;#define rep(i,l,r) for(int i=(l);i<=(r);i++)#define per(i,l,r) for(int i=(l);i>=(r);i--)#define ll long long#define mset(s,t) memset(s,t,sizeof(t))#define mcpy(s,t) memcpy(s,t,sizeof(t))#define fi first#define se second#define pb push_back#define all(x) (x).begin(),(x).end()#define SZ(x) ((int)(x).size())#define mp make_pairtypedef pair pii;typedef pair pll;typedef vector vi; typedef vector Vll; typedef vector > vpii;typedef vector > vpll; const ll mod = 1e9 + 7;//const ll mod = 998244353;const double pi = acos(-1.0);inline ll qmi (ll a, ll b) { ll ans = 1; while (b) { if (b & 1) ans = ans * a%mod; a = a * a %mod; b >>= 1; } return ans;}inline int read () { int x = 0, f = 0; char ch = getchar(); while (!isdigit(ch)) f |= (ch=='-'),ch= getchar(); while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar(); return f?-x:x;}template void print(T x) { if (x < 0) putchar('-'), x = -x; if (x >= 10) print(x/10); putchar(x % 10 + '0');}inline ll sub (ll a, ll b) { return ((a - b ) %mod + mod) %mod;}inline ll add (ll a, ll b) { return (a + b) %mod;}inline ll inv (ll a) { return qmi(a, mod - 2);}const int N = 1e6 + 10;int n;string s;int ne[N][26];int last[26];void solve() { cin >> s; int n; cin >> n; memset(last, -1, sizeof last); int len = s.size(); for (int i = len - 1; i >= 0; i --) { for (int j = 0; j < 26; j ++) ne[i][j] = last[j]; last[s[i] - 'a'] = i; } while (n --) { string s; cin >> s; int pos = last[s[0] - 'a']; if(pos == -1) { puts("No"); continue; } bool f = 1; for (int i = 1; i < s.size(); i ++) { pos = ne[pos][s[i] - 'a']; if (pos == -1) { puts("No"); f = 0; break; } } if (f) puts("Yes"); } }int main () { // ios::sync_with_stdio(0),cin.tie(0), cout.tie(0); int t; t =1; //cin >> t; while (t --) solve(); return 0;}

通过序列自动机，贪心的找位置。就可以得到最终的答案

版权声明：本文内容由网络用户投稿，版权归原作者所有，本站不拥有其著作权，亦不承担相应法律责任。如果您发现本站中有涉嫌抄袭或描述失实的内容，请联系我们jiasou666@gmail.com 处理，核实后本网站将在24小时内删除侵权内容。