結果

問題 No.2761 Substitute and Search
ユーザー tokusakuraitokusakurai
提出日時 2024-05-17 21:51:55
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 10,727 bytes
コンパイル時間 2,796 ms
コンパイル使用メモリ 215,268 KB
実行使用メモリ 30,208 KB
最終ジャッジ日時 2024-05-17 21:52:03
合計ジャッジ時間 5,760 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,812 KB
testcase_01 AC 2 ms
6,944 KB
testcase_02 AC 2 ms
6,940 KB
testcase_03 AC 2 ms
6,940 KB
testcase_04 WA -
testcase_05 WA -
testcase_06 AC 70 ms
30,208 KB
testcase_07 AC 214 ms
30,208 KB
testcase_08 AC 67 ms
30,208 KB
testcase_09 AC 216 ms
30,080 KB
testcase_10 AC 71 ms
30,080 KB
testcase_11 AC 220 ms
30,080 KB
testcase_12 AC 158 ms
30,208 KB
testcase_13 AC 156 ms
30,208 KB
testcase_14 AC 153 ms
30,080 KB
testcase_15 AC 154 ms
30,208 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define per(i, n) for (int i = (n) - 1; i >= 0; i--)
#define rep2(i, l, r) for (int i = (l); i < (r); i++)
#define per2(i, l, r) for (int i = (r) - 1; i >= (l); i--)
#define each(e, v) for (auto &e : v)
#define MM << " " <<
#define pb push_back
#define eb emplace_back
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;

template <typename T>
using minheap = priority_queue<T, vector<T>, greater<T>>;

template <typename T>
using maxheap = priority_queue<T>;

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

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

template <typename T>
int flg(T x, int i) {
    return (x >> i) & 1;
}

int pct(int x) { return __builtin_popcount(x); }
int pct(ll x) { return __builtin_popcountll(x); }
int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }
int topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }
int botbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); }
int botbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }

template <typename T>
void print(const vector<T> &v, T x = 0) {
    int n = v.size();
    for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' ');
    if (v.empty()) cout << '\n';
}

template <typename T>
void printn(const vector<T> &v, T x = 0) {
    int n = v.size();
    for (int i = 0; i < n; i++) cout << v[i] + x << '\n';
}

template <typename T>
void err_print(const vector<T> &v, T x = 0) {
    int n = v.size();
    for (int i = 0; i < n; i++) cerr << v[i] + x << ' ';
    cerr << endl;
}

template <typename T>
int lb(const vector<T> &v, T x) {
    return lower_bound(begin(v), end(v), x) - begin(v);
}

template <typename T>
int ub(const vector<T> &v, T x) {
    return upper_bound(begin(v), end(v), x) - begin(v);
}

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

template <typename T>
vector<int> id_sort(const vector<T> &v, bool greater = false) {
    int n = v.size();
    vector<int> ret(n);
    iota(begin(ret), end(ret), 0);
    sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; });
    return ret;
}

template <typename T>
void reorder(vector<T> &a, const vector<int> &ord) {
    int n = a.size();
    vector<T> b(n);
    for (int i = 0; i < n; i++) b[i] = a[ord[i]];
    swap(a, b);
}

template <typename T>
T floor(T x, T y) {
    assert(y != 0);
    if (y < 0) x = -x, y = -y;
    return (x >= 0 ? x / y : (x - y + 1) / y);
}

template <typename T>
T ceil(T x, T y) {
    assert(y != 0);
    if (y < 0) x = -x, y = -y;
    return (x >= 0 ? (x + y - 1) / y : x / y);
}

template <typename S, typename T>
pair<S, T> operator+(const pair<S, T> &p, const pair<S, T> &q) {
    return make_pair(p.first + q.first, p.second + q.second);
}

template <typename S, typename T>
pair<S, T> operator-(const pair<S, T> &p, const pair<S, T> &q) {
    return make_pair(p.first - q.first, p.second - q.second);
}

template <typename S, typename T>
istream &operator>>(istream &is, pair<S, T> &p) {
    S a;
    T b;
    is >> a >> b;
    p = make_pair(a, b);
    return is;
}

template <typename S, typename T>
ostream &operator<<(ostream &os, const pair<S, T> &p) {
    return os << p.first << ' ' << p.second;
}

struct io_setup {
    io_setup() {
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
        cerr << fixed << setprecision(15);
    }
} io_setup;

constexpr int inf = (1 << 30) - 1;
constexpr ll INF = (1LL << 60) - 1;
// constexpr int MOD = 1000000007;
constexpr int MOD = 998244353;

struct Random_Number_Generator {
    mt19937_64 mt;

    Random_Number_Generator() : mt(chrono::steady_clock::now().time_since_epoch().count()) {}

    int64_t operator()(int64_t l, int64_t r) {
        uniform_int_distribution<int64_t> dist(l, r - 1);
        return dist(mt);
    }

    int64_t operator()(int64_t r) { return (*this)(0, r); }
} rng;

using ull = unsigned long long;
const ull mod = (1ULL << 61) - 1;

ull hash_mod(ull x) {
    ull ret = (x >> 61) + (x & mod);
    return ret - (ret >= mod ? mod : 0);
}

ull hash_mul(ull x, ull y) {
    x = hash_mod(x), y = hash_mod(y);
    ull x1 = x >> 31, x2 = x & ((1ULL << 31) - 1), y1 = y >> 31, y2 = y & ((1ULL << 31) - 1);
    ull z = x1 * y2 + x2 * y1, z1 = z >> 30, z2 = z & ((1ULL << 30) - 1);
    return hash_mod(x1 * y1 * 2 + x2 * y2 + z1 + (z2 << 31));
}

ull hash_pow(ull x, ull n) {
    ull ret = 1;
    for (; n > 0; n >>= 1, x = hash_mul(x, x)) {
        if (n & 1) ret = hash_mul(ret, x);
    }
    return ret;
}

// m 以上の base を乱択で生成する
ull generate_base(ull m = (1ULL << 50)) {
    while (true) {
        ull k = rng(mod);
        if (gcd(mod - 1, k) != 1) continue;
        ull base = hash_pow(3, k);
        if (base >= m) return base;
    }
    return 0;
}

// 0 が含まれないように
template <typename T = string>
struct Rolling_Hash {
    const int n;
    const ull base; // 基数
    vector<ull> hashed, pw;

    Rolling_Hash(const T &s, ull base) : n(s.size()), base(base) {
        hashed.assign(n + 1, 0), pw.assign(n + 1, 1);
        for (int i = 0; i < n; i++) {
            pw[i + 1] = hash_mul(pw[i], base);
            hashed[i + 1] = hash_mul(hashed[i], base) + s[i];
            if (hashed[i + 1] >= mod) hashed[i + 1] -= mod;
        }
    }

    // 文字列の [l,r) の部分のハッシュ値
    ull get_hash(int l, int r) const {
        ull ret = hashed[r] + mod - hash_mul(hashed[l], pw[r - l]);
        return ret - (ret >= mod ? mod : 0);
    }

    ull get_all_hash() const { return hashed[n]; }

    // s[l1:r1] と s[l2:r2] の最長共通接頭辞
    int lcp(int l1, int r1, int l2, int r2) {
        int ok = 0, ng = min(r1 - l1, r2 - l2) + 1;
        while (ng - ok > 1) {
            int mid = (ok + ng) / 2;
            (get_hash(l1, l1 + mid) == get_hash(l2, l2 + mid) ? ok : ng) = mid;
        }
        return ok;
    }

    // s[l1:r1] と s[l2:r2] の辞書順大小比較 (-1 : <, 0 : =, 1 : >)
    int comp(int l1, int r1, int l2, int r2) {
        int d = lcp(l1, r1, l2, r2);
        if (r1 == l1 + d && r2 == l2 + d) return 0;
        if (r1 == l1 + d) return -1;
        if (r2 == l2 + d) return 1;
        return get_hash(l1 + d, l1 + d + 1) < get_hash(l2 + d, l2 + d + 1) ? -1 : 1;
    }
};

template <typename T>
struct Fixed_Size_Hash {
    const int n;
    const ull base;
    vector<T> v;
    ull hashed;
    vector<ull> pw;

    Fixed_Size_Hash(const vector<T> &v, ull base) : n(v.size()), base(base), v(v) {
        hashed = 0;
        pw.assign(n + 1, 1);
        for (int i = 0; i < n; i++) {
            pw[i + 1] = hash_mul(pw[i], base);
            hashed = hash_mul(hashed, base) + v[i];
            if (hashed >= mod) hashed -= mod;
        }
    }

    Fixed_Size_Hash(int m, const T &x, ull base) : Fixed_Size_Hash(vector<T>(m, x), base) {}

    ull add(int i, const T &x) {
        hashed += hash_mul(pw[n - 1 - i], mod + x);
        if (hashed >= mod) hashed -= mod;
        v[i] += x;
        return hashed;
    }

    ull change(int i, const T &x) { return add(i, x - v[i]); }

    ull get_hash() const { return hashed; }
};

template <typename T>
struct Binary_Indexed_Tree {
    vector<T> bit;
    const int n;

    Binary_Indexed_Tree(const vector<T> &v) : n((int)v.size()) {
        bit.resize(n + 1);
        copy(begin(v), end(v), begin(bit) + 1);
        build();
    }

    Binary_Indexed_Tree(int n, T x = 0) : Binary_Indexed_Tree(vector<T>(n, x)) {}

    void set(int i, const T &x) { bit[i + 1] = x; }

    void build() {
        for (int a = 2; a <= n; a <<= 1) {
            for (int b = a; b <= n; b += a) {
                bit[b] += bit[b - a / 2];
                if (bit[b] >= mod) bit[b] -= mod;
            }
        }
    }

    void add(int i, const T &x) {
        for (i++; i <= n; i += (i & -i)) {
            bit[i] += x;
            if (bit[i] >= mod) bit[i] -= mod;
        }
    }

    void change(int i, const T &x) { add(i, x - query(i, i + 1)); }

    T sum(int i) const {
        i = min(i, n);
        if (i <= 0) return 0;
        T ret = 0;
        for (; i > 0; i -= (i & -i)) {
            ret += bit[i];
            if (ret >= mod) ret -= mod;
        }
        return ret;
    }

    T query(int l, int r) const {
        l = max(l, 0), r = min(r, n);
        if (l >= r) return 0;
        return sum(r) - sum(l);
    }

    T operator[](int i) const { return query(i, i + 1); }

    // v[0]+...+v[r] >= x を満たす最小の r (なければ n)
    int lower_bound(T x) const {
        int ret = 0;
        for (int k = 31 - __builtin_clz(n); k >= 0; k--) {
            if (ret + (1 << k) <= n && bit[ret + (1 << k)] < x) x -= bit[ret += (1 << k)];
        }
        return ret;
    }

    // v[0]+...+v[r] > x を満たす最小の r (なければ n)
    int upper_bound(T x) const {
        int ret = 0;
        for (int k = 31 - __builtin_clz(n); k >= 0; k--) {
            if (ret + (1 << k) <= n && bit[ret + (1 << k)] <= x) x -= bit[ret += (1 << k)];
        }
        return ret;
    }
};

void solve() {
    int N, L, Q;
    cin >> N >> L >> Q;

    ull b = generate_base();
    vector<ull> pw(L + 1, 1);
    rep(i, L) pw[i + 1] = hash_mul(pw[i], b);

    vector<string> S(N);
    rep(i, N) cin >> S[i];

    vector<Binary_Indexed_Tree<ull>> bits;
    rep(i, N) {
        vector<ull> v(L);
        rep(j, L) v[j] = hash_mul(pw[j], S[i][j]);
        bits.emplace_back(v);
    }

    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) {
                    ll x = d - c;
                    if (x < 0) x += mod;
                    bits[i].add(k, hash_mul(pw[k], x));
                }
            }
        } else {
            string T;
            cin >> T;
            int X = sz(T);

            ull h = 0;
            rep(i, X) {
                h += hash_mul(pw[i], T[i]);
                if (h >= mod) h -= mod;
            }

            int ans = 0;
            rep(i, N) {
                if (bits[i].sum(X) == h) ans++;
            }

            cout << ans << '\n';
        }
    }
}

int main() {
    int T = 1;
    // cin >> T;
    while (T--) solve();
}
0