結果
問題 | No.2761 Substitute and Search |
ユーザー |
|
提出日時 | 2024-05-17 22:23:50 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 867 ms / 4,000 ms |
コード長 | 7,395 bytes |
コンパイル時間 | 8,187 ms |
コンパイル使用メモリ | 336,944 KB |
実行使用メモリ | 38,784 KB |
最終ジャッジ日時 | 2024-12-20 14:22:58 |
合計ジャッジ時間 | 15,495 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 13 |
ソースコード
#include <bits/stdc++.h>#include <atcoder/all>using namespace std;using namespace atcoder;#define all(...) std::begin(__VA_ARGS__), std::end(__VA_ARGS__)#define rall(...) std::rbegin(__VA_ARGS__), std::rend(__VA_ARGS__)#define OVERLOAD_REP(_1, _2, _3, _4, name, ...) name#define REP1(n) for(ll i=0;i<n;i++)#define REP2(i, n) for (ll i=0;i<n;i++)#define REP3(i, a, n) for (ll i=a;i<n;i++)#define REP4(i, a, b, n) for(ll i=a;i<n;i+=b)#define rep(...) OVERLOAD_REP(__VA_ARGS__, REP4, REP3, REP2, REP1)(__VA_ARGS__)#define OVERLOAD_RREP(_1, _2, _3, _4, name, ...) name#define RREP1(n) for(ll i=n-1;i>=0;i--)#define RREP2(i, n) for(ll i=n-1;i>=0;i--)#define RREP3(i, a, n) for(ll i=n-1;i>=a;i--)#define RREP4(i, a, b, n) for(ll i=n-1;i>=a;i-=b)#define rrep(...) OVERLOAD_RREP(__VA_ARGS__, RREP4, RREP3, RREP2, RREP1)(__VA_ARGS__)#define foa(a,v) (auto& a : (v))#define uniq(a) sort(all(a));a.erase(unique(all(a)),end(a))#define len(n) (long long)(n).size()#define pb push_backusing ll = long long;using ld = long double;using ull = unsigned long long;using vi = vector<int>;using vvi = vector<vi>;using vvvi = vector<vvi>;using vll = vector<ll>;using vvll = vector<vll>;using vvvll = vector<vvll>;using vs = vector<string>;using vvs = vector<vs>;using vvvs = vector<vvs>;using vld = vector<ld>;using vvld = vector<vld>;using vvvld = vector<vvld>;using vc = vector<char>;using vvc = vector<vc>;using vvvc = vector<vvc>;using pll = pair<ll,ll>;using vpll = vector<pll>;template<class... T>constexpr auto min(T... a){return min(initializer_list<common_type_t<T...>>{a...});}template<class... T>constexpr auto max(T... a){return max(initializer_list<common_type_t<T...>>{a...});}template<class... T>void input(T&... a){(cin >> ... >> a);}ll POW(ll a,ll b){ll ans = 1;while (b){if (b & 1){ans *= a;}a *= a;b /= 2;}return ans;}ll MODPOW(ll a,ll b,ll c){ll ans = 1;while (b){if (b & 1){ans *= a;ans %= c;}a *= a;a %= c;b /= 2;}return ans;}#define OVERLOAD_POW(_1, _2, _3, name, ...) name#define pow(...) OVERLOAD_POW(__VA_ARGS__, MODPOW, POW)(__VA_ARGS__)#define INT(...) int __VA_ARGS__; input(__VA_ARGS__)#define LL(...) ll __VA_ARGS__; input(__VA_ARGS__)#define ULL(...) ull __VA_ARGS__; input(__VA_ARGS__)#define LD(...) ld __VA_ARGS__; input(__VA_ARGS__)#define STR(...) string __VA_ARGS__; input(__VA_ARGS__)#define CHA(...) char __VA_ARGS__; input(__VA_ARGS__)#define VLL(name,length) vll name(length);rep(i,length){cin >> name[i];}#define VVLL(name,h,w) vvll name(h,vll(w));rep(i,h)rep(j,w){cin >> name[i][j];}#define VVVLL(name,a,b,c) vvvll name(a,vvll(b,vll(c)));rep(i,a)rep(j,b)rep(k,c){cin >> name[i][j][k];}#define VI(name,length) vi name(length);rep(i,length){cin >> name[i];}#define VVI(name,h,w) vvi name(h,vi(w));rep(i,h)rep(j,w){cin >> name[i][j];}#define VVVI(name,a,b,c) vvvi name(a,vvll(b,vi(c)));rep(i,a)rep(j,b)rep(k,c){cin >> name[i][j][k];}#define VLD(name,length) vld name(length);rep(i,length){cin >> name[i];}#define VVLD(name,h,w) vvld name(h,vld(w));rep(i,h)rep(j,w){cin >> name[i][j];}#define VVVLD(name,a,b,c) vvvld name(a,vvld(b,vld(c)));rep(i,a)rep(j,b)rep(k,c){cin >> name[i][j][k];}#define VC(name,length) vc name(length);rep(i,length){cin >> name[i];}#define VVC(name,h,w) vvc name(h,vc(w));rep(i,h)rep(j,w){cin >> name[i][j];}#define VVVC(name,a,b,c) vvvc name(a,vvc(b,vc(c)));rep(i,a)rep(j,b)rep(k,c){cin >> name[i][j][k];}#define VS(name,length) vs name(length);rep(i,length){cin >> name[i];}#define VVS(name,h,w) vvs name(h,vs(w));rep(i,h)rep(j,w){cin >> name[i][j];}#define VVVS(name,a,b,c) vvvs name(a,vvs(b,vs(c)));rep(i,a)rep(j,b)rep(k,c){cin >> name[i][j][k];}#define PLL(name) pll name;cin>>name.first>>name.second;#define VPLL(name,length) vpll name(length);rep(i,length){cin>>name[i].first>>name[i].second;}void print(){cout << "\n";}template<class T, class... Ts>void print(const T& a, const Ts&... b){cout << a;(cout << ... << (cout << ' ', b));cout << '\n';}void print(vll x){rep(i,len(x)){cout << x[i];if(i!=len(x)-1){cout << " ";}else{cout << '\n';}}}void print(vvll x){rep(i,len(x))rep(j,len(x[i])){cout << x[i][j];if(j!=len(x[i])-1){cout << " ";}else{cout << '\n';}}}void print(vi x){rep(i,len(x)){cout << x[i];if(i!=len(x)-1){cout << " ";}else{cout << '\n';}}}void print(vvi x){rep(i,len(x))rep(j,len(x[i])){cout << x[i][j];if(j!=len(x[i])-1){cout << " ";}else{cout << '\n';}}}void print(vvvi x){rep(i,len(x))rep(j,len(x[i]))rep(k,len(x[i][j])){cout << x[i][j][k];if(k!=len(x[i][j])-1){cout << " ";}else if(j!=len(x[i])-1){cout << " | ";}else{cout << '\n';}}}void print(vld x){rep(i,len(x)){cout << x[i];if(i!=len(x)-1){cout << " ";}else{cout << '\n';}}}void print(vvld x){rep(i,len(x))rep(j,len(x[i])){cout << x[i][j];if(j!=len(x[i])-1){cout << " ";}else{cout << '\n';}}}void print(vvvld x){rep(i,len(x))rep(j,len(x[i]))rep(k,len(x[i][j])){cout << x[i][j][k];if(k!=len(x[i][j])-1){cout << " ";}else if(j!=len(x[i])-1){cout << " | ";}else{cout << '\n';}}}void print(vc x){rep(i,len(x)){cout << x[i];if(i!=len(x)-1){cout << " ";}else{cout << '\n';}}}void print(vvc x){rep(i,len(x))rep(j,len(x[i])){cout << x[i][j];if(j!=len(x[i])-1){cout << " ";}else{cout << '\n';}}}void print(vvvc x){rep(i,len(x))rep(j,len(x[i]))rep(k,len(x[i][j])){cout << x[i][j][k];if(k!=len(x[i][j])-1){cout << " ";}else if(j!=len(x[i])-1){cout << " | ";}else{cout << '\n';}}}void print(vs x){rep(i,len(x)){cout << x[i];if(i!=len(x)-1){cout << " ";}else{cout << '\n';}}}void print(vvs x){rep(i,len(x))rep(j,len(x[i])){cout << x[i][j];if(j!=len(x[i])-1){cout << " ";}else{cout << '\n';}}}void print(vvvs x){rep(i,len(x))rep(j,len(x[i]))rep(k,len(x[i][j])){cout << x[i][j][k];if(k!=len(x[i][j])-1){cout << " ";}else if(j!=len(x[i])-1){cout << " | ";}else{cout << '\n';}}}void print(pll x){cout << x.first << x.second << '\n';}void print(vpll x){rep(i,len(x)){cout << x[i].first << x[i].second << '\n';}}using mint = modint998244353;mint op(mint x,mint y){return x + y;}mint e(){return (mint)0;}int main(){LL(n,l,q);vector<mint> v(l,0);vector<segtree<mint,op,e>> lst;segtree<mint,op,e> st(v);rep(i,n){lst.push_back(st);}ll base = 63826;vs s;vector<mint> base_pow;base_pow.push_back((mint)1);rep(i,5000){auto x = base_pow.back();base_pow.push_back(x * base);}rep(i,n){STR(t);s.push_back(t);rep(j,l){lst[i].set(j,(t[j] - 'a') * base_pow[j]);}}rep(wccr,q){int e;cin >> e;if(e == 1){int k;char c,d;cin >> k >> c >> d;k--;rep(i,n){if(s[i][k] == c){lst[i].set(k,(d - 'a') * base_pow[k]);s[i][k] = d;}}}else{STR(r);int ans = 0;mint temp = 0;rep(i,len(r)){temp += (r[i] - 'a') * base_pow[i];}rep(i,n){if(lst[i].prod(0,len(r)) == temp){ans++;}}print(ans);}}}