結果
| 問題 | No.2761 Substitute and Search |
| ユーザー |
 dyktr_06
|
| 提出日時 | 2024-05-17 22:58:52 |
| 言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
| 結果 |
TLE
(最新)
AC
(最初)
|
| 実行時間 | - |
| コード長 | 8,641 bytes |
| コンパイル時間 | 8,100 ms |
| コンパイル使用メモリ | 272,676 KB |
| 最終ジャッジ日時 | 2025-02-21 15:18:52 |
|
ジャッジサーバーID （参考情報） |
judge2 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 12 TLE * 1 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define overload4(_1, _2, _3, _4, name, ...) name#define rep1(n) for(int i = 0; i < (int)(n); ++i)#define rep2(i, n) for(int i = 0; i < (int)(n); ++i)#define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i)#define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c))#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i)#define ALL(a) (a).begin(), (a).end()#define Sort(a) (sort((a).begin(), (a).end()))#define RSort(a) (sort((a).rbegin(), (a).rend()))#define UNIQUE(a) (a.erase(unique((a).begin(), (a).end()), (a).end()))typedef long long int ll;typedef unsigned long long ul;typedef long double ld;typedef vector<int> vi;typedef vector<long long> vll;typedef vector<char> vc;typedef vector<string> vst;typedef vector<double> vd;typedef vector<long double> vld;typedef pair<long long, long long> P;template<class T> long long sum(const T& a){ return accumulate(a.begin(), a.end(), 0LL); }template<class T> auto min(const T& a){ return *min_element(a.begin(), a.end()); }template<class T> auto max(const T& a){ return *max_element(a.begin(), a.end()); }const long long MINF = 0x7fffffffffff;const long long INF = 0x1fffffffffffffff;const long long MOD = 998244353;const long double EPS = 1e-9;const long double PI = acos(-1);template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; }template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; returnos; }template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; return is; }template<typename T> ostream &operator<<(ostream &os, const vector<T> &v){ for(int i = 0; i < (int) v.size(); ++i){ os << v[i] << (i + 1 != (int) v.size() ? " " : ""); } return os; }template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " ";} return os; }template <typename T> ostream &operator<<(ostream &os, const set<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr<< (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os <<*itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }template <typename T> ostream &operator<<(ostream &os, queue<T> q){ while(q.size()){ os << q.front() << " "; q.pop(); } return os; }template <typename T> ostream &operator<<(ostream &os, deque<T> q){ while(q.size()){ os << q.front() << " "; q.pop_front(); } return os; }template <typename T> ostream &operator<<(ostream &os, stack<T> st){ while(st.size()){ os << st.top() << " "; st.pop(); } return os; }template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){ while(pq.size()){ os<< pq.top() << " "; pq.pop(); } return os; }template<class T, class U> inline T vin(T& vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; }template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; }template<class... T> void in(T&... a){ (cin >> ... >> a); }void out(){ cout << '\n'; }template<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }template<class T, class U> void inGraph(vector<vector<T>>& G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b;cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } }struct RollingHash{vector<unsigned long long> hashed, power;const unsigned long long mod = (1uLL << 61) - 1;unsigned long long mul(unsigned long long a, unsigned long long b) const {long long ret = a * b - mod * (unsigned long long)(1.0L / mod * a * b);return ret + mod * (ret < 0) - mod * (ret >= (long long) mod);}RollingHash(const string &s, unsigned base = 10007){int siz = (int) s.size();hashed.assign(siz + 1, 0);power.assign(siz + 1, 0);power[0] = 1;for(int i = 0; i < siz; i++){power[i + 1] = mul(power[i], base);hashed[i + 1] = mul(hashed[i], base) + s[i];if(hashed[i + 1] >= mod) hashed[i + 1] -= mod;}}// [l, r)unsigned long long get(int l, int r) const {unsigned long long ret = hashed[r] + mod - mul(hashed[l], power[r - l]);if(ret >= mod) ret -= mod;return ret;}unsigned long long connect(unsigned long long h1, unsigned long long h2, int h2len) const {unsigned long long ret = mul(h1, power[h2len]) + h2;if(ret >= mod) ret -= mod;return ret;}int LCP(const RollingHash &b, int l1, int r1, int l2, int r2){int len = min(r1 - l1, r2 - l2);int low = -1, high = len + 1;while(high - low > 1){int mid = (low + high) / 2;if(get(l1, l1 + mid) == b.get(l2, l2 + mid)) low = mid;else high = mid;}return low;}};template <typename X>struct SegTree{using FX = function<X(X, X)>; // X•X -> X となる関数の型int n;FX fx;const X ex;vector<X> dat;SegTree(int n_, const FX &fx_, const X &ex_) : n(), fx(fx_), ex(ex_){int x = 1;while(n_ > x){x *= 2;}n = x;dat.assign(n * 2, ex);}X get(int i) const {return dat[i + n];}void set(int i, const X &x){ dat[i + n] = x; }void build(){for(int k = n - 1; k >= 1; k--) dat[k] = fx(dat[k * 2], dat[k * 2 + 1]);}void update(int i, const X &x){i += n;dat[i] = x;while(i > 0){i >>= 1; // parentdat[i] = fx(dat[i * 2], dat[i * 2 + 1]);}}X query(int a, int b){X vl = ex;X vr = ex;int l = a + n;int r = b + n;while(l < r){if(l & 1) vl = fx(vl, dat[l++]);if(r & 1) vr = fx(dat[--r], vr);l >>= 1;r >>= 1;}return fx(vl, vr);}X operator [](int i) const {return dat[i + n];}};unsigned long long mod = (1LL << 61) - 1;unsigned long long mul(unsigned long long a, unsigned long long b) {long long ret = a * b - mod * (unsigned long long)(1.0L / mod * a * b);return ret + mod * (ret < 0) - mod * (ret >= (long long) mod);}void input(){}void solve(){ll n, l, q; in(n, l, q);vst s; vin(s, n);using T = pair<ul, ll>;ul base = 10007;vector<ul> power(2 * l + 1, 1);rep(i, 2 * l){power[i + 1] = mul(power[i], base);power[i + 1] %= mod;}// {hash, len}ll check = 0;auto fx = [&](T a, T b){auto [hash1, len1] = a;auto [hash2, len2] = b;if(len1 + len2 > l){return make_pair((ul) 0, 0LL);}ul hash = hash1 + mul(hash2, power[len1]);if(hash >= mod) hash -= mod;return make_pair(hash, len1 + len2);};vector<SegTree<pair<ul, ll>>> seg(n, SegTree<pair<ul, ll>>(l, fx, make_pair((ul) 0, 0LL)));rep(i, n){rep(j, l){seg[i].update(j, make_pair((ul) s[i][j], 1));}}while(q--){ll T; in(T);if(T == 1){ll k;char c, d; in(k, c, d);k--;rep(i, n){if(s[i][k] == c){s[i][k] = d;seg[i].update(k, make_pair((ul) d, 1));}}}else{string t; in(t);ll len = t.size();ul h = 0;rep(i, len){h += mul(power[i], t[i]);h %= mod;}ll ans = 0;rep(i, n){if(seg[i].query(0, len).first == h){ans++;}}out(ans);}}}int main(){ios::sync_with_stdio(false);cin.tie(nullptr);cout << fixed << setprecision(20);input();solve();}