結果

問題 No.2761 Substitute and Search
ユーザー wingu
提出日時 2024-06-10 21:42:42
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
TLE  
実行時間 -
コード長 4,175 bytes
コンパイル時間 4,645 ms
コンパイル使用メモリ 288,560 KB
実行使用メモリ 271,104 KB
最終ジャッジ日時 2025-01-02 20:33:52
合計ジャッジ時間 40,258 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 12 TLE * 1
権限があれば一括ダウンロードができます

ソースコード

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

#include <bits/stdc++.h>
using namespace std;
#ifdef DEFINED_ONLY_IN_LOCAL
#include <dump.hpp>
#define dump(...) cpp_dump(__VA_ARGS__)
#else
#undef dump
#define dump(...)
#endif
#define rep1(i, a) for (int i = 0; i < (int)(a); i++)
#define rep2(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep3(i, a, b, c) for (int i = (int)(a); i < (int)(b); i += (int)(c))
#define overloadRep(a, b, c, d, e, ...) e
#define rep(...) overloadRep(__VA_ARGS__, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
#define drep(i, a, b) for (int i = (int)(a); i >= (int)(b); i--)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
using ll = long long;
using P = pair<ll, ll>;
using T = tuple<ll, ll, ll>;
const int inf = 1e9;
const ll INF = 1e18;
const int dx[4] = {0, 1, 0, -1};
const int dy[4] = {1, 0, -1, 0};
struct cincout {
    cincout() {
        ios_base::sync_with_stdio(false);
        cin.tie(nullptr);
        cout << fixed << setprecision(15);
    }
} init;
template <class T>
inline bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template <class T>
inline bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T>
istream &operator>>(istream &is, vector<T> &v) {
    for (T &in : v) {
        is >> in;
    }
    return is;
}
template <class T>
ostream &operator<<(ostream &os, const vector<T> &v) {
    rep(i, (int)v.size()) {
        os << v[i] << " \n"[i + 1 == (int)v.size()];
    }
    return os;
}
template <class T>
istream &operator>>(istream &is, vector<vector<T>> &vv) {
    for (vector<T> &v : vv) {
        is >> v;
    }
    return is;
}
template <class T>
ostream &operator<<(ostream &os, vector<vector<T>> &vv) {
    for (vector<T> &v : vv) {
        os << v;
    }
    return os;
}
template <class T1, class T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
    is >> p.first >> p.second;
    return is;
}
template <class T1, class T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
    os << p.first << " " << p.second << '\n';
    return os;
}
bool bit(ll x, int p) {
    return (x >> p) & 1;
}
bool out(int ni, int nj, int h, int w) {
    return (ni < 0 or ni >= h or nj < 0 or nj >= w);
}
int pc(ll x) {
    return __builtin_popcountll(x);
}
#include <atcoder/segtree>
using namespace atcoder;
const int base1 = 1007, base2 = 2009;
const int mod1 = 1000000007, mod2 = 1000000009;
P op(P l, P r) {
    auto [a, b] = l;
    auto [c, d] = r;
    ll res = (a * d + c) % mod1;
    return P(res, (b * d) % mod1);
}
P op2(P l, P r) {
    auto [a, b] = l;
    auto [c, d] = r;
    ll res = (a * d + c) % mod2;
    return P(res, (b * d) % mod2);
}
P e(){
    return P(0, 1);
}
struct seg_rol{
    segtree<P, op, e> seg1;
    segtree<P, op2, e> seg2;
    seg_rol(const string &s) {
        int n = s.size();
        seg1 = segtree<P, op, e>(n);
        seg2 = segtree<P, op2, e>(n);
        rep (i, n) {
            seg1.set(i, P(s[i], base1));
            seg2.set(i, P(s[i], base2));
        }
    }
    void set(int i, char c) {
        seg1.set(i, P(c, base1));
        seg2.set(i, P(c, base2));
    }
    ll get(int l, int r) {
        ll res = seg1.prod(l, r).first;
        res *= mod2;
        res += seg2.prod(l, r).first;
        return res;
    }
};
int main(){
    int n,l,q;cin>>n>>l>>q;
    vector<string> s(n);cin>>s;
    vector<seg_rol> rol(n,string(""));
    rep(i,n){
        rol[i] = seg_rol(s[i]);
    }
    while(q--){
        int t;cin>>t;
        if(t==1){
            int k;
            char c, d;
            cin>>k>>c>>d;
            k--;
            rep(i,n){
                if(s[i][k]==c){
                    s[i][k]=d;
                    rol[i].set(k, d);
                }
            }
        }else{
            string T;
            cin>>T;
            seg_rol cur(T);
            int m=T.size();
            ll cor=cur.get(0,m);
            int ans=0;
            rep(i,n){
                if(rol[i].get(0,m)==cor)ans++;
            }
            cout<<ans<<endl;
        }
    }
    return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0