結果

問題 No.2761 Substitute and Search
ユーザー pitP
提出日時 2024-05-17 22:51:26
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
TLE  
実行時間 -
コード長 3,542 bytes
コンパイル時間 5,593 ms
コンパイル使用メモリ 319,012 KB
実行使用メモリ 194,448 KB
最終ジャッジ日時 2024-12-20 14:53:42
合計ジャッジ時間 28,693 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 12 TLE * 1
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
istream &operator>>(istream &is, modint &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint &a) { return os << a.val(); }
istream &operator>>(istream &is, modint998244353 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint998244353 &a) { return os << a.val(); }
istream &operator>>(istream &is, modint1000000007 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint1000000007 &a) { return os << a.val(); } 
typedef long long ll;
typedef vector<vector<int>> Graph;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define FOR(i,l,r) for (int i = l;i < (int)(r); i++)
#define rep(i,n) for (int i = 0;i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define my_sort(x) sort(x.begin(), x.end())
#define my_max(x) *max_element(all(x))
#define my_min(x) *min_element(all(x))
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; }
const int INF = (1<<30) - 1;
const ll LINF = (1LL<<62) - 1;
const int MOD = 998244353;
const int MOD2 = 1e9+7;
const double PI = acos(-1);
vector<int> di = {1,0,-1,0};
vector<int> dj = {0,1,0,-1};
#ifdef LOCAL
#  include <debug_print.hpp>
#  define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define debug(...) (static_cast<void>(0))
#endif
struct RollingHash{
    long long base = 114514;
    long long mod = 1000000007;
    int N;
    vector<long long> hash;
    vector<long long> pw;
    RollingHash(string &S){
        N = S.size();
        hash.resize(N + 1, 0);
        pw.resize(N + 1, 1);
        for(int i = 0; i < N; i++){
            hash[i + 1] = (hash[i] * base + S[i]) % mod;
            pw[i + 1] = pw[i] * base % mod;
        }
    }
    long long get(int l, int r){
        return (hash[r] - (hash[l] * pw[r - l]) % mod + mod) % mod;
    }
};
long long base = 114514;
long long mod = 1000000007;
using T = array<long long, 2>;
T op(T lhs, T rhs){
    T res;
    res[0] = (lhs[0] * rhs[1] + rhs[0]) % mod;
    res[1]= (lhs[1] * rhs[1]) % mod;
    return res;
}
T e(){
    return T{0, 1};
}
int flg, k, m, ans;
char c, d;
string t;
long long target, hsh;
T res;
int main(){
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    int N, L, Q; cin >> N >> L >> Q;
    vector<string> S(N);
    rep(i, N) cin >> S[i];
    string W;
    vector<int> wa(N + 1, 0);
    rep(i, N) {
        W += S[i];
        wa[i + 1] = wa[i] + (int)S[i].size();
    }
    auto change = [&](char c){
        T res;
        res[0] = c;
        res[1] = base;
        return res;
    };
    vector<T> vec(L * N);
    rep(i, L * N) vec[i] = change(W[i]);
    segtree<T,op,e> seg(vec);
    while(Q--){
        cin >> flg;
        if(flg == 1){
            cin >> k >> c >> d;
            k--;
            rep(i, N){
                if(W[wa[i] + k] == c){
                    W[wa[i] + k] = d;
                    seg.set(wa[i] + k, change(d));
                }
            }
        }
        else{
            cin >> t;
            m = t.size();
            RollingHash rh(t);
            target = rh.get(0, m);
            ans = 0;
            rep(i, N){
                if(target == seg.prod(wa[i], wa[i] + m)[0]) ans++;
            }
            cout << ans << endl;
        }
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0