#982198 (C++17) No.2761 Substitute and Search

提出ソース
結果

問題	No.2761 Substitute and Search
コンテスト
ユーザー	siganai
提出日時	2024-05-17 21:58:26
言語	C++17 (gcc 13.3.0 + boost 1.87.0)
結果	AC
実行時間	2,727 ms / 4,000 ms
コード長	13,757 bytes
コンパイル時間	2,440 ms
コンパイル使用メモリ	214,068 KB
最終ジャッジ日時	2025-02-21 14:48:54
ジャッジサーバーID （参考情報）	judge1 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン	結果
sample	AC * 3
other	AC * 13
権限があれば一括ダウンロードができます
ソースコード

raw source code
#line 1 "main.cpp"
#include<bits/stdc++.h>
//#pragma GCC target("avx,avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#ifdef LOCAL
#include <debug.hpp>
#define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#define debug(...) (static_cast<void>(0))
#endif
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll,ll>;
using pii = pair<int,int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vul = vector<ull>;
using vpii = vector<pii>;
using vvpii = vector<vpii>;
using vpll = vector<pll>;
using vs = vector<string>;
template<class T> using pq = priority_queue<T,vector<T>, greater<T>>;
#define overload4(_1, _2, _3, _4, name, ...) name
#define overload3(a,b,c,name,...) name
#define rep1(n) for (ll UNUSED_NUMBER = 0; UNUSED_NUMBER < (n); ++UNUSED_NUMBER)
#define rep2(i, n) for (ll i = 0; i < (n); ++i)
#define rep3(i, a, b) for (ll i = (a); i < (b); ++i)
#define rep4(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep1(n) for(ll i = (n) - 1;i >= 0;i--)
#define rrep2(i,n) for(ll i = (n) - 1;i >= 0;i--)
#define rrep3(i,a,b) for(ll i = (b) - 1;i >= (a);i--)
#define rrep4(i,a,b,c) for(ll i = (a) + ((b)-(a)-1) / (c) * (c);i >= (a);i -= c)
#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)
#define all1(i) begin(i) , end(i)
#define all2(i,a) begin(i) , begin(i) + a
#define all3(i,a,b) begin(i) + a , begin(i) + b
#define all(...) overload3(__VA_ARGS__, all3, all2, all1)(__VA_ARGS__)
#define sum(...) accumulate(all(__VA_ARGS__),0LL)
template<class T> bool chmin(T &a, const T &b){ if(a > b){ a = b; return 1; } else return 0; }
template<class T> bool chmax(T &a, const T &b){ if(a < b){ a = b; return 1; } else return 0; }
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... Ts> void in(Ts&... t);
#define INT(...) int __VA_ARGS__; in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__; in(__VA_ARGS__)
#define STR(...) string __VA_ARGS__; in(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__; in(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__; in(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__; in(__VA_ARGS__)
#define VEC(type, name, size) vector<type> name(size); in(name)
#define VV(type, name, h, w) vector<vector<type>> name(h, vector<type>(w)); in(name)
ll intpow(ll a, ll b){ ll ans = 1; while(b){if(b & 1) ans *= a; a *= a; b /= 2;} return ans;}
ll modpow(ll a, ll b, ll p){ ll ans = 1; a %= p;if(a < 0) a += p;while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
bool is_clamp(ll val,ll low,ll high) {return low <= val && val < high;}
void Yes() {cout << "Yes\n";return;}
void No() {cout << "No\n";return;}
void YES() {cout << "YES\n";return;}
void NO() {cout << "NO\n";return;}
template <typename T>
T floor(T a, T b) {return a / b - (a % b && (a ^ b) < 0);}
template <typename T>
T ceil(T x, T y) {return floor(x + y - 1, y);}
template <typename T>
T bmod(T x, T y) {return x - y * floor(x, y);}
template <typename T>
pair<T, T> divmod(T x, T y) {T q = floor(x, y);return {q, x - q * y};}
namespace IO{
#define VOID(a) decltype(void(a))
struct setting{ setting(){cin.tie(nullptr); ios::sync_with_stdio(false);fixed(cout); cout.precision(12);}} setting;
template<int I> struct P : P<I-1>{};
template<> struct P<0>{};
template<class T> void i(T& t){ i(t, P<3>{}); }
void i(vector<bool>::reference t, P<3>){ int a; i(a); t = a; }
template<class T> auto i(T& t, P<2>) -> VOID(cin >> t){ cin >> t; }
template<class T> auto i(T& t, P<1>) -> VOID(begin(t)){ for(auto&& x : t) i(x); }
template<class T, size_t... idx> void ituple(T& t, index_sequence<idx...>){in(get<idx>(t)...);}
template<class T> auto i(T& t, P<0>) -> VOID(tuple_size<T>{}){ituple(t, make_index_sequence<tuple_size<T>::value>{});} 
#undef VOID
}
#define unpack(a) (void)initializer_list<int>{(a, 0)...}
template<class... Ts> void in(Ts&... t){ unpack(IO :: i(t)); }
#undef unpack
constexpr long double PI = 3.141592653589793238462643383279L;
template <class F> struct REC {
    F f;
    REC(F &&f_) : f(forward<F>(f_)) {}
    template <class... Args> auto operator()(Args &&...args) const { return f(*this, forward<Args>(args)...); }};

constexpr int mod = 998244353;
//constexpr int mod = 1000000007;
#line 2 "library/inner/inner-hash.hpp"
namespace inner {
    using i64 = long long;
    using u64 = unsigned long long;
    using u128 = __int128_t;
    template <int BASE_NUM = 2>
    struct Hash: array<u64, BASE_NUM> {
        using array<u64, BASE_NUM>::operator[];
        static constexpr int n = BASE_NUM;

        Hash():array<u64, BASE_NUM>() {}

        static constexpr u64 md = (1ull << 61) - 1;

        constexpr static Hash set(const i64 &a) {
            Hash res;
            fill(begin(res),end(res),cast(a));
            return res;
        }

        Hash &operator+=(const Hash &r) {
            for(int i = 0;i < n; i++) {
                if(((*this)[i] += r[i]) >= md) (*this)[i] -= md;
            }
            return *this;
        }
        Hash &operator+=(const i64 &r) {
            u64 s = cast(r);
            for (int i = 0; i < n; i++) {
                if (((*this)[i] += s) >= md) (*this)[i] -= md;
            }
            return *this;
        }
        Hash &operator-=(const Hash &r) {
            for (int i = 0; i < n; i++) {
                if (((*this)[i] += md - r[i]) >= md) (*this)[i] -= md;
            }
            return *this;
        }
        Hash &operator-=(const i64 &r) {
            u64 s = cast(r);
            for (int i = 0; i < n; i++) {
                if (((*this)[i] += md - s) >= md) (*this)[i] -= md;
            }
            return *this;
        }
        Hash &operator*=(const Hash &r) {
            for (int i = 0; i < n; i++) {
                (*this)[i] = modmul((*this)[i], r[i]);
            }
            return *this;
        }
        Hash &operator*=(const i64 &r) {
            u64 s = cast(r);
            for (int i = 0; i < n; i++) {
                (*this)[i] = modmul((*this)[i], s);
            }
            return *this;
        }

        Hash operator+(const Hash &r) { return Hash(*this) += r; }
        Hash operator+(const i64 &r) { return Hash(*this) += r; }
        Hash operator-(const Hash &r) { return Hash(*this) -= r; }
        Hash operator-(const i64 &r) { return Hash(*this) -= r; }
        Hash operator*(const Hash &r) { return Hash(*this) *= r; }
        Hash operator*(const i64 &r) { return Hash(*this) *= r; }
        Hash operator-() const {
            Hash res;
            for (int i = 0; i < n; i++) {
                res[i] = (*this)[i] == 0 ? 0 : md - (*this)[i];
            }
            return res;
        }
        friend Hash pfma(const Hash &a, const Hash &b, const Hash &c) {
            Hash res;
            for (int i = 0; i < n; i++) {
                res[i] = modfma(a[i], b[i], c[i]);
            }
            return res;
        }
        // a * b + c (mod p)
        friend Hash pfma(const Hash &a, const Hash &b, const i64 &c) {
            Hash res;
            u64 s = cast(c);
            for (int i = 0; i < n; i++) {
                res[i] = modfma(a[i], b[i], s);
            }
            return res;
        }
        Hash pow(long long e) {
            Hash a{*this}, res{Hash::set(1)};
            for (; e; a *= a, e >>= 1) {
                if (e & 1) res *= a;
            }
            return res;
        }
        static Hash get_basis() {
            static auto rand_time =
            chrono::duration_cast<chrono::nanoseconds>(
            chrono::high_resolution_clock::now().time_since_epoch())
            .count();
            static mt19937_64 rng(rand_time);
            Hash h;
            for (int i = 0; i < n; i++) {
                while (isPrimitive(h[i] = rng() % (md - 1) + 1) == false);
            }
            return h;
        }

    private:
        static u64 modpow(u64 a, u64 b) {
            u64 r = 1;
            for (a %= md; b; a = modmul(a, a), b >>= 1) r = modmul(r, a);
            return r;
        }
        static bool isPrimitive(u64 x) {
            for (auto &d : vector<u64>{2, 3, 5, 7, 11, 13, 31, 41, 61, 151, 331, 1321})
            if (modpow(x, (md - 1) / d) <= 1) return false;
            return true;
        }
        static inline constexpr u64 cast(const long long &a) {
            return a < 0 ? a + md : a;
        }
        static inline constexpr u64 modmul(const u64 &a, const u64 &b) {
            u128 ret = u128(a) * b;
            ret = (ret & md) + (ret >> 61);
            return ret >= md ? ret - md : ret;
        }
        static inline constexpr u64 modfma(const u64 &a, const u64 &b, const u64 &c) {
            u128 ret = u128(a) * b + c;
            ret = (ret & md) + (ret >> 61);
            return ret >= md ? ret - md : ret;
        }
    };
}
#line 2 "library/segtree/segtree.hpp"
template <typename T, typename OP>
struct segtree {
    int N;
    int size;
    vector<T> seg;
    const OP op;
    const T I;
    segtree(OP _op, const T &I_) : N(0), size(0), op(_op), I(I_) {}
    segtree(int _N, OP _op, const T &I_) : op(_op), I(I_) { init(_N); }
    segtree(const vector<T> &v, OP _op, T I_) : op(_op), I(I_) {
        init(v.size());
        for (int i = 0; i < (int)v.size(); i++) {
            seg[i + size] = v[i];
        }
        build();
    }
    void init(int _N) {
        N = _N;
        size = 1;
        while (size < N) size <<= 1;
        seg.assign(2 * size, I);
    }
    void build() {
        for (int k = size - 1; k > 0; k--) {
            seg[k] = op(seg[2 * k], seg[2 * k + 1]);
        }
    }
    void set(int p, T x) {
        assert(0 <= p && p < N);
        p += size;
        seg[p] = x;
        while (p >>= 1) {
            seg[p] = op(seg[2 * p], seg[2 * p + 1]);
        }
    }
    void add(int p, T x) {
        assert(0 <= p && p < N);
        p += size;
        seg[p] += x;
        while (p >>= 1) {
            seg[p] = op(seg[2 * p], seg[2 * p + 1]);
        }
    }
    T get(int p) const {
        assert(0 <= p && p < N);
        return seg[p + size];
    }
    // query to [l, r)
    T prod(int l, int r) {
        assert(0 <= l && l <= r && r <= N);
        T L = I, R = I;
        for (l += size, r += size; l < r; l >>= 1, r >>= 1) {
            if (l & 1) L = op(L, seg[l++]);
            if (r & 1) R = op(seg[--r], R);
        }
        return op(L, R);
    }
    T all_prod() {return seg[1];}
    // check(a[l] * ...  * a[r-1]) が true となる最大の r
    // (右端まですべて true なら N を返す)
    template <class C>
    int max_right(int l, C check) {
        assert(0 <= l && l <= N);
        assert(check(I) == true);
        if (l == N) return N;
        l += size;
        T sm = I;
        do {
            while (l % 2 == 0) l >>= 1;
            if (!check(op(sm, seg[l]))) {
                while (l < size) {
                    l = (2 * l);
                    if (check(op(sm, seg[l]))) {
                        sm = op(sm, seg[l]);
                        l++;
                    }
                }
                return l - size;
            }
            sm = op(sm, seg[l]);
            l++;
        } while ((l & -l) != l);
        return N;
    }
    // check(a[l] * ... * a[r-1]) が true となる最小の l
    // (左端まで true なら 0 を返す)
    template <typename C>
    int min_left(int r, C check) {
        assert(0 <= r && r <= N);
        assert(check(I) == true);
        if (r == 0) return 0;
        r += size;
        T sm = I;
        do {
            r--;
            while (r > 1 && (r % 2)) r >>= 1;
            if (!check(op(seg[r], sm))) {
                while (r < size) {
                    r = (2 * r + 1);
                    if (check(op(seg[r], sm))) {
                        sm = op(seg[r], sm);
                        r--;
                    }
                }
                return r + 1 - size;
            }
            sm = op(seg[r], sm);
        } while ((r & -r) != r);
        return 0;
    }
};
#line 100 "main.cpp"
using Hash = inner::Hash<2>;
struct dat {
    Hash x = Hash::set(0);
    int si = 0;
};
dat e() {return dat();}
int main() {
    INT(n,l,q);
    VEC(string,s,n);
    Hash base = Hash::get_basis();
    vector<Hash> powb(l+1);
    powb[0] = Hash::set(1);
    rep(i,1,l+1) powb[i] = powb[i-1] * base;
    auto op = [&](dat x,dat y){
        if(y.si == 0) return x;
        if(x.si == 0) return y;
        dat ret;
        ret.x = pfma(x.x,powb[y.si],y.x);
        ret.si = x.si + y.si;
        return ret;
    };
    vector<segtree<dat,decltype(op)>> seg;
    rep(i,n) {
        vector<dat> init(l);
        rep(j,l) {
            init[j].x = Hash::set(1) * s[i][j];
            init[j].si = 1;
        }
        seg.emplace_back(segtree<dat,decltype(op)>(init,op,e()));
    }
    rep(i,q) {
        INT(cmd);
        if(cmd == 1) {
            INT(k);
            CHR(c,d);
            k--;
            rep(j,n) {
                if(s[j][k] == c) {
                    s[j][k] = d;
                    seg[j].set(k,{Hash::set(1)*d,1});
                }
            }
        }
        else {
            STR(t);
            int S = t.size();
            int ans = 0;
            Hash val = Hash::set(0);
            rep(j,S) {
                val = pfma(val,powb[1],t[j]);
            }
            rep(j,n) {
                if(seg[j].prod(0,S).x == val) ans++;
            }
            cout << ans << '\n';
        }
    }
}
yukicoder

結果

ソースコード
