結果

問題 No.2761 Substitute and Search
コンテスト
ユーザー noya2
提出日時 2024-05-24 00:02:15
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 722 ms / 4,000 ms
コード長 8,237 bytes
コンパイル時間 3,669 ms
コンパイル使用メモリ 263,024 KB
実行使用メモリ 33,152 KB
最終ジャッジ日時 2024-12-20 19:09:34
合計ジャッジ時間 10,984 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 13
権限があれば一括ダウンロードができます

ソースコード

diff # 

#line 2 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"
using namespace std;

#include<bits/stdc++.h>
#line 1 "/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp"
namespace noya2 {

template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p){
    os << p.first << " " << p.second;
    return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p){
    is >> p.first >> p.second;
    return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v){
    int s = (int)v.size();
    for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
    return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v){
    for (auto &x : v) is >> x;
    return is;
}

void in() {}
template <typename T, class... U>
void in(T &t, U &...u){
    cin >> t;
    in(u...);
}

void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u){
    cout << t;
    if (sizeof...(u)) cout << sep;
    out(u...);
}

template<typename T>
void out(const vector<vector<T>> &vv){
    int s = (int)vv.size();
    for (int i = 0; i < s; i++) out(vv[i]);
}

struct IoSetup {
    IoSetup(){
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
        cerr << fixed << setprecision(7);
    }
} iosetup_noya2;

} // namespace noya2
#line 1 "/Users/noya2/Desktop/Noya2_library/template/const.hpp"
namespace noya2{

const int iinf = 1'000'000'007;
const long long linf = 2'000'000'000'000'000'000LL;
const long long mod998 =  998244353;
const long long mod107 = 1000000007;
const long double pi = 3.14159265358979323;
const vector<int> dx = {0,1,0,-1,1,1,-1,-1};
const vector<int> dy = {1,0,-1,0,1,-1,-1,1};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string NUM = "0123456789";

void yes(){ cout << "Yes\n"; }
void no(){ cout << "No\n"; }
void YES(){ cout << "YES\n"; }
void NO(){ cout << "NO\n"; }
void yn(bool t){ t ? yes() : no(); }
void YN(bool t){ t ? YES() : NO(); }

} // namespace noya2
#line 1 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"
namespace noya2{

unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){
    if (a == 0 || b == 0) return a + b;
    int n = __builtin_ctzll(a); a >>= n;
    int m = __builtin_ctzll(b); b >>= m;
    while (a != b) {
        int mm = __builtin_ctzll(a - b);
        bool f = a > b;
        unsigned long long c = f ? a : b;
        b = f ? b : a;
        a = (c - b) >> mm;
    }
    return a << min(n, m);
}

template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(abs(a),abs(b))); }

long long sqrt_fast(long long n) {
    if (n <= 0) return 0;
    long long x = sqrt(n);
    while ((x + 1) * (x + 1) <= n) x++;
    while (x * x > n) x--;
    return x;
}

template<typename T> T floor_div(const T n, const T d) {
    assert(d != 0);
    return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);
}

template<typename T> T ceil_div(const T n, const T d) {
    assert(d != 0);
    return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);
}

template<typename T> void uniq(vector<T> &v){
    sort(v.begin(),v.end());
    v.erase(unique(v.begin(),v.end()),v.end());
}

template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }

template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }

template<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }

} // namespace noya2
#line 8 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"

#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)
#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)
#define all(v) (v).begin(),(v).end()

using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;

namespace noya2{

/*　~ (. _________ . /)　*/

}

using namespace noya2;


#line 2 "c.cpp"

namespace noya2{

struct dynamic_RollingHash {
    dynamic_RollingHash(const string &s = ""){ build(s); }
    ull get(int l, int r){ 
        assert(0 <= l && l <= r && r <= n);
        return cal_mod(prefix_sum(r) + POSITIVISER - mul_mod(prefix_sum(l), pow_base[r-l]));
    }
    void update(int p, char nexc){
        assert(0 <= p && p < n);
        ll d = nexc - str[p];
        if (d < 0) d += MOD;
        change(p,d);
        str[p] = nexc;
    }
    static ull get_hash(const string &s){
        int len = s.size();
        set_hash();
        extend_pow_base(len);
        ull res = 0;
        for (int i = 0; i < len; i++) res = cal_mod(mul_mod(res,BASE) + s[i]);
        return res;
    }
    template<class... Hash_Lengths> static ull concat(const Hash_Lengths&... hash_length){
        return inner_concat(0ULL,hash_length...);
    }
  private:
    static ull inner_concat(const ull& temp){
        return temp;
    }
    template<class... Tail> static ull inner_concat(const ull& temp, const ull& hash, const int& len, const Tail&... tail){
        return inner_concat(cal_mod(cal_mod(mul_mod(temp,pow_base[len]))+hash),tail...);
    }
    static constexpr ull MASK30 = (1ULL << 30) - 1;
    static constexpr ull MASK31 = (1ULL << 31) - 1;
    static constexpr ull MASK61 = (1ULL << 61) - 1;
    static constexpr ull MOD = (1ULL << 61) - 1;
    static constexpr ull POSITIVISER = MOD * 4;
    static ull BASE;
    static vector<ull> pow_base;
    static ull mul_mod(ull a, ull b){
        ull au = a >> 31, ad = a & MASK31;
        ull bu = b >> 31, bd = b & MASK31;
        ull mid = ad * bu + au * bd;
        ull midu = mid >> 30, midd = mid & MASK30;
        return (au * bu * 2 + midu + (midd << 31) + ad * bd);
    }
    static ull cal_mod(ull x){
        ull xu = x >> 61;
        ull xd = x & MASK61;
        ull res = xu + xd;
        if (res >= MOD) res -= MOD;
        return res;
    }
    static void set_hash(){
        if (BASE == 0) BASE = (1UL<<31) + (random_device()() & MASK31);
    }
    static void extend_pow_base(int len){
        int nlen = pow_base.size();
        if (nlen > len) return ;
        pow_base.resize(len+1);
        for (int i = nlen; i <= len; i++){
            pow_base[i] = cal_mod(mul_mod(pow_base[i-1],BASE));
        }
    }
    void change(int p, ull nex){
        p++;
        while (p <= n) {
            inner_hash[p - 1] = cal_mod(inner_hash[p - 1]+nex);
            nex = cal_mod(mul_mod(nex,pow_base[p & -p]));
            p += p & -p;
        }
    }
    ull prefix_sum(int r){
        int tr = r;
        ull s = 0;
        while (r > 0) {
            s = cal_mod(mul_mod(inner_hash[r - 1],pow_base[tr-r])+s);
            r -= r & -r;
        }
        return s;
    }
    string str;
    int n;
    vector<ull> inner_hash;
    void build(const string &s){
        set_hash();
        str = s;
        n = s.size();
        extend_pow_base(n);
        inner_hash.resize(n,0);
        for (int i = 0; i < n; i++){
            change(i,ull(s[i]));
        }
    }
};
unsigned long long dynamic_RollingHash::BASE = 0;
vector<unsigned long long> dynamic_RollingHash::pow_base = vector<unsigned long long>(1,1);
using droriha = dynamic_RollingHash;

} // namespace noya2

void solve(){
    int n, l, q; in(n,l,q);
    vector<string> a(n); in(a);
    vector<droriha> ds(n);
    rep(i,n){
        ds[i] = droriha(a[i]);
    }
    while (q--){
        int t; in(t);
        if (t == 1){
            int k; in(k); k--;
            char c, d; in(c,d);
            rep(i,n){
                if (a[i][k] != c) continue;
                ds[i].update(k, d);
                a[i][k] = d;
            }
        }
        else {
            string s; in(s);
            ull hs = droriha::get_hash(s);
            int ans = 0;
            rep(i,n){
                if (ds[i].get(0,s.size()) == hs){
                    ans++;
                }
            }
            out(ans);
        }
    }
}

int main(){
    int t = 1; //in(t);
    while (t--) { solve(); }
}
0