結果

問題 No.2761 Substitute and Search
ユーザー 👑 rin204rin204
提出日時 2024-05-18 00:55:19
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,594 ms / 4,000 ms
コード長 16,352 bytes
コンパイル時間 3,742 ms
コンパイル使用メモリ 268,532 KB
実行使用メモリ 138,624 KB
最終ジャッジ日時 2024-05-18 00:55:35
合計ジャッジ時間 13,220 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 1 ms
6,944 KB
testcase_02 AC 2 ms
6,940 KB
testcase_03 AC 1 ms
6,944 KB
testcase_04 AC 840 ms
138,496 KB
testcase_05 AC 1,594 ms
138,496 KB
testcase_06 AC 251 ms
138,368 KB
testcase_07 AC 984 ms
138,368 KB
testcase_08 AC 251 ms
138,496 KB
testcase_09 AC 998 ms
138,496 KB
testcase_10 AC 250 ms
138,496 KB
testcase_11 AC 1,017 ms
138,368 KB
testcase_12 AC 658 ms
138,496 KB
testcase_13 AC 610 ms
138,496 KB
testcase_14 AC 638 ms
138,624 KB
testcase_15 AC 638 ms
138,496 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
// #define INTERACTIVE

#include <bits/stdc++.h>
using namespace std;

namespace templates {
// type
using ll  = long long;
using ull = unsigned long long;
using Pii = pair<int, int>;
using Pil = pair<int, ll>;
using Pli = pair<ll, int>;
using Pll = pair<ll, ll>;
template <class T>
using pq = priority_queue<T>;
template <class T>
using qp = priority_queue<T, vector<T>, greater<T>>;
// clang-format off
#define vec(T, A, ...) vector<T> A(__VA_ARGS__);
#define vvec(T, A, h, ...) vector<vector<T>> A(h, vector<T>(__VA_ARGS__));
#define vvvec(T, A, h1, h2, ...) vector<vector<vector<T>>> A(h1, vector<vector<T>>(h2, vector<T>(__VA_ARGS__)));
// clang-format on

// for loop
#define fori1(a) for (ll _ = 0; _ < (a); _++)
#define fori2(i, a) for (ll i = 0; i < (a); i++)
#define fori3(i, a, b) for (ll i = (a); i < (b); i++)
#define fori4(i, a, b, c) for (ll i = (a); ((c) > 0 || i > (b)) && ((c) < 0 || i < (b)); i += (c))
#define overload4(a, b, c, d, e, ...) e
#define fori(...) overload4(__VA_ARGS__, fori4, fori3, fori2, fori1)(__VA_ARGS__)

// declare and input
// clang-format off
#define INT(...) int __VA_ARGS__; inp(__VA_ARGS__);
#define LL(...) ll __VA_ARGS__; inp(__VA_ARGS__);
#define STRING(...) string __VA_ARGS__; inp(__VA_ARGS__);
#define CHAR(...) char __VA_ARGS__; inp(__VA_ARGS__);
#define DOUBLE(...) double __VA_ARGS__; STRING(str___); __VA_ARGS__ = stod(str___);
#define VEC(T, A, n) vector<T> A(n); inp(A);
#define VVEC(T, A, n, m) vector<vector<T>> A(n, vector<T>(m)); inp(A);
// clang-format on

// const value
const ll MOD1   = 1000000007;
const ll MOD9   = 998244353;
const double PI = acos(-1);

// other macro
#if !defined(RIN__LOCAL) && !defined(INTERACTIVE)
#define endl "\n"
#endif
#define spa ' '
#define len(A) ll(A.size())
#define all(A) begin(A), end(A)

// function
vector<char> stoc(string &S) {
    int n = S.size();
    vector<char> ret(n);
    for (int i = 0; i < n; i++) ret[i] = S[i];
    return ret;
}
string ctos(vector<char> &S) {
    int n      = S.size();
    string ret = "";
    for (int i = 0; i < n; i++) ret += S[i];
    return ret;
}

template <class T>
auto min(const T &a) {
    return *min_element(all(a));
}
template <class T>
auto max(const T &a) {
    return *max_element(all(a));
}
template <class T, class S>
auto clamp(T &a, const S &l, const S &r) {
    return (a > r ? r : a < l ? l : a);
}
template <class T, class S>
inline bool chmax(T &a, const S &b) {
    return (a < b ? a = b, 1 : 0);
}
template <class T, class S>
inline bool chmin(T &a, const S &b) {
    return (a > b ? a = b, 1 : 0);
}
template <class T, class S>
inline bool chclamp(T &a, const S &l, const S &r) {
    auto b = clamp(a, l, r);
    return (a != b ? a = b, 1 : 0);
}

template <typename T>
T sum(vector<T> &A) {
    T tot = 0;
    for (auto a : A) tot += a;
    return tot;
}

template <typename T>
vector<T> compression(vector<T> X) {
    sort(all(X));
    X.erase(unique(all(X)), X.end());
    return X;
}

// input and output
namespace io {
// __int128_t
std::ostream &operator<<(std::ostream &dest, __int128_t value) {
    std::ostream::sentry s(dest);
    if (s) {
        __uint128_t tmp = value < 0 ? -value : value;
        char buffer[128];
        char *d = std::end(buffer);
        do {
            --d;
            *d = "0123456789"[tmp % 10];
            tmp /= 10;
        } while (tmp != 0);
        if (value < 0) {
            --d;
            *d = '-';
        }
        int len = std::end(buffer) - d;
        if (dest.rdbuf()->sputn(d, len) != len) {
            dest.setstate(std::ios_base::badbit);
        }
    }
    return dest;
}

// vector<T>
template <typename T>
istream &operator>>(istream &is, vector<T> &A) {
    for (auto &a : A) is >> a;
    return is;
}
template <typename T>
ostream &operator<<(ostream &os, vector<T> &A) {
    for (size_t i = 0; i < A.size(); i++) {
        os << A[i];
        if (i != A.size() - 1) os << ' ';
    }
    return os;
}

// vector<vector<T>>
template <typename T>
istream &operator>>(istream &is, vector<vector<T>> &A) {
    for (auto &a : A) is >> a;
    return is;
}
template <typename T>
ostream &operator<<(ostream &os, vector<vector<T>> &A) {
    for (size_t i = 0; i < A.size(); i++) {
        os << A[i];
        if (i != A.size() - 1) os << endl;
    }
    return os;
}

// pair<S, T>
template <typename S, typename T>
istream &operator>>(istream &is, pair<S, T> &A) {
    is >> A.first >> A.second;
    return is;
}
template <typename S, typename T>
ostream &operator<<(ostream &os, pair<S, T> &A) {
    os << A.first << ' ' << A.second;
    return os;
}

// vector<pair<S, T>>
template <typename S, typename T>
istream &operator>>(istream &is, vector<pair<S, T>> &A) {
    for (size_t i = 0; i < A.size(); i++) {
        is >> A[i];
    }
    return is;
}
template <typename S, typename T>
ostream &operator<<(ostream &os, vector<pair<S, T>> &A) {
    for (size_t i = 0; i < A.size(); i++) {
        os << A[i];
        if (i != A.size() - 1) os << endl;
    }
    return os;
}

// tuple
template <typename T, size_t N>
struct TuplePrint {
    static ostream &print(ostream &os, const T &t) {
        TuplePrint<T, N - 1>::print(os, t);
        os << ' ' << get<N - 1>(t);
        return os;
    }
};
template <typename T>
struct TuplePrint<T, 1> {
    static ostream &print(ostream &os, const T &t) {
        os << get<0>(t);
        return os;
    }
};
template <typename... Args>
ostream &operator<<(ostream &os, const tuple<Args...> &t) {
    TuplePrint<decltype(t), sizeof...(Args)>::print(os, t);
    return os;
}

// io functions
void FLUSH() {
    cout << flush;
}

void print() {
    cout << endl;
}
template <class Head, class... Tail>
void print(Head &&head, Tail &&...tail) {
    cout << head;
    if (sizeof...(Tail)) cout << spa;
    print(std::forward<Tail>(tail)...);
}

template <typename T, typename S>
void prisep(vector<T> &A, S sep) {
    int n = A.size();
    for (int i = 0; i < n; i++) {
        cout << A[i];
        if (i != n - 1) cout << sep;
    }
    cout << endl;
}
template <typename T, typename S>
void priend(T A, S end) {
    cout << A << end;
}
template <typename T>
void prispa(T A) {
    priend(A, spa);
}
template <typename T, typename S>
bool printif(bool f, T A, S B) {
    if (f)
        print(A);
    else
        print(B);
    return f;
}

template <class... T>
void inp(T &...a) {
    (cin >> ... >> a);
}

} // namespace io
using namespace io;

// read graph
vector<vector<int>> read_edges(int n, int m, bool direct = false, int indexed = 1) {
    vector<vector<int>> edges(n, vector<int>());
    for (int i = 0; i < m; i++) {
        INT(u, v);
        u -= indexed;
        v -= indexed;
        edges[u].push_back(v);
        if (!direct) edges[v].push_back(u);
    }
    return edges;
}
vector<vector<int>> read_tree(int n, int indexed = 1) {
    return read_edges(n, n - 1, false, indexed);
}

template <typename T = long long>
vector<vector<pair<int, T>>> read_wedges(int n, int m, bool direct = false, int indexed = 1) {
    vector<vector<pair<int, T>>> edges(n, vector<pair<int, T>>());
    for (int i = 0; i < m; i++) {
        INT(u, v);
        T w;
        inp(w);
        u -= indexed;
        v -= indexed;
        edges[u].push_back({v, w});
        if (!direct) edges[v].push_back({u, w});
    }
    return edges;
}
template <typename T = long long>
vector<vector<pair<int, T>>> read_wtree(int n, int indexed = 1) {
    return read_wedges<T>(n, n - 1, false, indexed);
}

// yes / no
namespace yesno {

// yes
inline bool yes(bool f = true) {
    cout << (f ? "yes" : "no") << endl;
    return f;
}
inline bool Yes(bool f = true) {
    cout << (f ? "Yes" : "No") << endl;
    return f;
}
inline bool YES(bool f = true) {
    cout << (f ? "YES" : "NO") << endl;
    return f;
}

// no
inline bool no(bool f = true) {
    cout << (!f ? "yes" : "no") << endl;
    return f;
}
inline bool No(bool f = true) {
    cout << (!f ? "Yes" : "No") << endl;
    return f;
}
inline bool NO(bool f = true) {
    cout << (!f ? "YES" : "NO") << endl;
    return f;
}

// possible
inline bool possible(bool f = true) {
    cout << (f ? "possible" : "impossible") << endl;
    return f;
}
inline bool Possible(bool f = true) {
    cout << (f ? "Possible" : "Impossible") << endl;
    return f;
}
inline bool POSSIBLE(bool f = true) {
    cout << (f ? "POSSIBLE" : "IMPOSSIBLE") << endl;
    return f;
}

// impossible
inline bool impossible(bool f = true) {
    cout << (!f ? "possible" : "impossible") << endl;
    return f;
}
inline bool Impossible(bool f = true) {
    cout << (!f ? "Possible" : "Impossible") << endl;
    return f;
}
inline bool IMPOSSIBLE(bool f = true) {
    cout << (!f ? "POSSIBLE" : "IMPOSSIBLE") << endl;
    return f;
}

// Alice Bob
inline bool Alice(bool f = true) {
    cout << (f ? "Alice" : "Bob") << endl;
    return f;
}
inline bool Bob(bool f = true) {
    cout << (f ? "Bob" : "Alice") << endl;
    return f;
}

// Takahashi Aoki
inline bool Takahashi(bool f = true) {
    cout << (f ? "Takahashi" : "Aoki") << endl;
    return f;
}
inline bool Aoki(bool f = true) {
    cout << (f ? "Aoki" : "Takahashi") << endl;
    return f;
}

} // namespace yesno
using namespace yesno;

} // namespace templates
using namespace templates;

template <class S, S (*op)(S, S), S (*e)()>
struct segtree {
  public:
    segtree() : segtree(0) {}
    explicit segtree(int n) : segtree(std::vector<S>(n, e())) {};
    explicit segtree(const std::vector<S> &v) : _n(int(v.size())) {
        size = 1;
        log  = 0;
        while (size < _n) {
            log++;
            size <<= 1;
        }
        d = std::vector<S>(2 * size, e());
        for (int i = 0; i < _n; i++) d[size + i] = v[i];
        for (int i = size - 1; i >= 1; i--) update(i);
    }

    void set(int p, S x) {
        assert(0 <= p && p < _n);
        p += size;
        d[p] = x;
        for (int i = 1; i <= log; i++) update(p >> i);
    }

    S get(int p) {
        assert(0 <= p && p < _n);
        return d[p + size];
    }

    S prod(int l, int r) {
        assert(0 <= l && l <= r && r <= _n);
        S sml = e(), smr = e();

        l += size;
        r += size;

        while (l < r) {
            if (l & 1) sml = op(sml, d[l++]);
            if (r & 1) smr = op(d[--r], smr);
            l >>= 1;
            r >>= 1;
        }
        return op(sml, smr);
    }

  private:
    int _n, size, log;
    std::vector<S> d;
    void update(int k) {
        d[k] = op(d[2 * k], d[2 * k + 1]);
    }
};

struct Modint261 {
    using u64                = uint64_t;
    using u128               = __uint128_t;
    static constexpr u64 MOD = (1ull << 61ull) - 1;

    u64 x;
    Modint261() : x(0) {}
    Modint261(u64 x) : x(x % MOD) {}
    Modint261(const Modint261 &m) : x(m.x) {}

    Modint261 &operator=(const Modint261 &m) {
        x = m.x;
        return *this;
    }
    Modint261 &operator+=(const Modint261 &m) {
        x = Add(x, m.x);
        return *this;
    }
    Modint261 &operator-=(const Modint261 &m) {
        x = Add(x, MOD - m.x);
        return *this;
    }
    Modint261 &operator*=(const Modint261 &m) {
        x = Mul(x, m.x);
        return *this;
    }

    Modint261 operator+(const Modint261 &m) const {
        return Modint261(*this) += m;
    }
    Modint261 operator-(const Modint261 &m) const {
        return Modint261(*this) -= m;
    }
    Modint261 operator*(const Modint261 &m) const {
        return Modint261(*this) *= m;
    }
    Modint261 operator-() const {
        return Modint261(MOD - x);
    }

    friend Modint261 operator+(const u64 &lhs, const Modint261 &rhs) {
        return Modint261(lhs) += rhs;
    }
    friend Modint261 operator-(const u64 &lhs, const Modint261 &rhs) {
        return Modint261(lhs) -= rhs;
    }
    friend Modint261 operator*(const u64 &lhs, const Modint261 &rhs) {
        return Modint261(lhs) *= rhs;
    }

    bool operator==(const Modint261 &m) const {
        return x == m.x;
    }
    bool operator!=(const Modint261 &m) const {
        return x != m.x;
    }

    friend std::ostream &operator<<(std::ostream &os, const Modint261 &m) {
        return os << m.x;
    }
    friend std::istream &operator>>(std::istream &is, Modint261 &m) {
        return is >> m.x;
    }

    u64 Mul(u64 a, u64 b) {
        u128 c = (u128)a * b;
        return Add(c >> 61, c & MOD);
    }

    u64 Add(u64 a, u64 b) {
        a += b;
        if (a >= MOD) a -= MOD;
        return a;
    }
};

struct RandomNumberGenerator {
    std::mt19937 mt;
    RandomNumberGenerator() : mt(std::chrono::steady_clock::now().time_since_epoch().count()) {}
    RandomNumberGenerator(int seed) : mt(seed) {}

    int operator()(int a, int b) {
        std::uniform_int_distribution<int> dist(a, b - 1);
        return dist(mt);
    }

    int operator()(int b) {
        return (*this)(0, b);
    }

    template <typename T>
    void shuffle(std::vector<T> &v) {
        std::shuffle(v.begin(), v.end(), mt);
    }
};
RandomNumberGenerator rng;

vector<Modint261> h;
struct S {
    Modint261 x;
    int len;
};
S op(S a, S b) {
    return {a.x * h[b.len] + b.x, a.len + b.len};
}
S e() {
    return {0, 0};
}

void solve() {
    LL(n, l, Q);
    h.resize(l + 1);
    h[0]                   = 1;
    ll base                = rng(1 << 30);
    fori(i, 1, l + 1) h[i] = h[i - 1] * base;

    VVEC(char, SS, n, l);
    using SEG = segtree<S, op, e>;
    vec(SEG, seg, n);
    fori(i, n) {
        vec(S, v, l);
        fori(j, l) v[j] = {SS[i][j] - 'a', 1};
        seg[i]          = SEG(v);
    }

    fori(Q) {
        INT(t);
        if (t == 1) {
            INT(k);
            CHAR(c, d);
            k--;
            fori(i, n) {
                if (SS[i][k] == c) {
                    SS[i][k] = d;
                    seg[i].set(k, {d - 'a', 1});
                }
            }
        } else {
            STRING(T);
            int le           = len(T);
            Modint261 hash   = 0;
            fori(i, le) hash = hash * base + T[i] - 'a';

            ll ans = 0;
            fori(i, n) {
                if (seg[i].prod(0, le).x == hash) ans++;
            }

            print(ans);
        }
    }
}

int main() {
#ifndef INTERACTIVE
    cin.tie(0)->sync_with_stdio(0);
#endif
    // cout << fixed << setprecision(12);
    int t;
    t = 1;
    // cin >> t;
    while (t--) solve();
    return 0;
}

// // #pragma GCC target("avx2")
// // #pragma GCC optimize("O3")
// // #pragma GCC optimize("unroll-loops")
// // #define INTERACTIVE
//
// #include "kyopro-cpp/template.hpp"
//
// #include "data_structure/segTree.hpp"
// #include "misc/Modint261.hpp"
// #include "misc/RandomNumberGenerator.hpp"
// RandomNumberGenerator rng;
//
// vector<Modint261> h;
// struct S {
//     Modint261 x;
//     int len;
// };
// S op(S a, S b) {
//     return {a.x * h[b.len] + b.x, a.len + b.len};
// }
// S e() {
//     return {0, 0};
// }
//
// void solve() {
//     LL(n, l, Q);
//     h.resize(l + 1);
//     h[0]                   = 1;
//     ll base                = rng(1 << 30);
//     fori(i, 1, l + 1) h[i] = h[i - 1] * base;
//
//     VVEC(char, SS, n, l);
//     using SEG = segtree<S, op, e>;
//     vec(SEG, seg, n);
//     fori(i, n) {
//         vec(S, v, l);
//         fori(j, l) v[j] = {SS[i][j] - 'a', 1};
//         seg[i]          = SEG(v);
//     }
//
//     fori(Q) {
//         INT(t);
//         if (t == 1) {
//             INT(k);
//             CHAR(c, d);
//             k--;
//             fori(i, n) {
//                 if (SS[i][k] == c) {
//                     SS[i][k] = d;
//                     seg[i].set(k, {d - 'a', 1});
//                 }
//             }
//         } else {
//             STRING(T);
//             int le           = len(T);
//             Modint261 hash   = 0;
//             fori(i, le) hash = hash * base + T[i] - 'a';
//
//             ll ans = 0;
//             fori(i, n) {
//                 if (seg[i].prod(0, le).x == hash) ans++;
//             }
//
//             print(ans);
//         }
//     }
// }
//
// int main() {
// #ifndef INTERACTIVE
//     cin.tie(0)->sync_with_stdio(0);
// #endif
//     // cout << fixed << setprecision(12);
//     int t;
//     t = 1;
//     // cin >> t;
//     while (t--) solve();
//     return 0;
// }
0