#include <bits/stdc++.h> #define fi first #define sc second #define pb push_back #define rep(i,p,k) for(int i=(p);i<(k);++i) #define forn(i,p,k) for(int i=(p);i<=(k);++i) #define forr(i,k,p) for(int i=(k)-1;i>=(p);--i) #define each(a,b) for(auto&a:b) #define all(v) begin(v), end(v) #define RET(smth) return void(cout<<(smth)<<'\n'); #define sz(v) (int)v.size() using namespace std; using pii = pair<int,int>; using ll = long long; using lll = __int128_t; using Vi = vector<int>; #ifdef DEBUG #include "debug.h" #else #define debug(...) ; #endif map<string, int> cnt; void load(string & t, const char * s, int l) { if(!l) { ++cnt[t]; return; } load(t, s+1, l-1); t += *s; load(t, s+1, l-1); t.pop_back(); } int solve(string const & s) { cnt.clear(); string t{}; load(t, s.data(), sz(s)); int r = 0; for(auto &[_, c] : cnt) if(c >= 2) r++; return r; } int main() { #ifndef DEBUG cin.tie(0) -> sync_with_stdio(0); #endif int n,q; cin >> n >> q; string s; cin >> s; cout << solve(s) << '\n'; while(q--) { int i; char z; cin >> i >> z; s[i-1] = z; cout << solve(s) << '\n'; } return 0; }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 | #include <bits/stdc++.h> #define fi first #define sc second #define pb push_back #define rep(i,p,k) for(int i=(p);i<(k);++i) #define forn(i,p,k) for(int i=(p);i<=(k);++i) #define forr(i,k,p) for(int i=(k)-1;i>=(p);--i) #define each(a,b) for(auto&a:b) #define all(v) begin(v), end(v) #define RET(smth) return void(cout<<(smth)<<'\n'); #define sz(v) (int)v.size() using namespace std; using pii = pair<int,int>; using ll = long long; using lll = __int128_t; using Vi = vector<int>; #ifdef DEBUG #include "debug.h" #else #define debug(...) ; #endif map<string, int> cnt; void load(string & t, const char * s, int l) { if(!l) { ++cnt[t]; return; } load(t, s+1, l-1); t += *s; load(t, s+1, l-1); t.pop_back(); } int solve(string const & s) { cnt.clear(); string t{}; load(t, s.data(), sz(s)); int r = 0; for(auto &[_, c] : cnt) if(c >= 2) r++; return r; } int main() { #ifndef DEBUG cin.tie(0) -> sync_with_stdio(0); #endif int n,q; cin >> n >> q; string s; cin >> s; cout << solve(s) << '\n'; while(q--) { int i; char z; cin >> i >> z; s[i-1] = z; cout << solve(s) << '\n'; } return 0; } |