結果

問題 No.430 文字列検索
ユーザー PachicobuePachicobue
提出日時 2017-11-17 18:34:28
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 4,127 bytes
コンパイル時間 1,729 ms
コンパイル使用メモリ 179,636 KB
実行使用メモリ 27,648 KB
最終ジャッジ日時 2024-11-10 00:18:25
合計ジャッジ時間 3,021 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 WA -
testcase_02 WA -
testcase_03 WA -
testcase_04 WA -
testcase_05 AC 2 ms
5,248 KB
testcase_06 WA -
testcase_07 WA -
testcase_08 AC 157 ms
27,648 KB
testcase_09 AC 3 ms
5,248 KB
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>

#define show(x) cerr << #x << " = " << x << endl

using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;

template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v)
{
    os << "sz=" << v.size() << "\n[";
    for (const auto& p : v) {
        os << p << ",";
    }
    os << "]\n";
    return os;
}

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


constexpr ll MOD = 1e9 + 7;

template <typename T>
constexpr T INF = numeric_limits<T>::max() / 100;

template <typename Container, typename HashType = ll, HashType mod1 = static_cast<HashType>(1000000007), HashType mod2 = static_cast<HashType>(1000000009), HashType add1 = static_cast<HashType>(1000010007), HashType add2 = static_cast<HashType>(1003333331)>
class RollingHash
{
public:
    static constexpr HashType MOD1 = mod1;
    static constexpr HashType MOD2 = mod2;
    using T = HashType;
    RollingHash(const Container& original) : size(original.size()), mt{random_device{}()}, base1{getRand1()}, base2{getRand2()}, pow1(size + 1, 1), pow2(size + 1, 1), accum_hash1(size + 1, 0), accum_hash2(size + 1, 0)
    {
        for (int i = 1; i <= size; i++) {
            pow1[i] = (pow1[i - 1] * base1) % mod1;
            accum_hash1[i] = (accum_hash1[i - 1] * base1 + add1 + static_cast<T>(original[i - 1])) % mod1;
        }
        for (int i = 1; i <= size; i++) {
            pow2[i] = (pow2[i - 1] * base2) % mod2;
            accum_hash2[i] = (accum_hash2[i - 1] * base2 + add2 + static_cast<T>(original[i - 1])) % mod2;
        }
    }
    RollingHash(const Container& original, const T base1, const T base2) : size(original.size()), mt{random_device{}()}, base1{base1}, base2{base2}, pow1(size + 1, 1), pow2(size + 1, 1), accum_hash1(size + 1, 0), accum_hash2(size + 1, 0)
    {
        for (int i = 1; i <= size; i++) {
            pow1[i] = (pow1[i - 1] * base1) % mod1;
            accum_hash1[i] = (accum_hash1[i - 1] * base1 + add1 + static_cast<T>(original[i - 1])) % mod1;
        }
        for (int i = 1; i <= size; i++) {
            pow2[i] = (pow2[i - 1] * base2) % mod2;
            accum_hash2[i] = (accum_hash2[i - 1] * base2 + add2 + static_cast<T>(original[i - 1])) % mod2;
        }
    }

    pair<T, T> getHash(const int l, const int r) const  // [l,r)
    {
        const T h1 = (((accum_hash1[r] - accum_hash1[l] * pow1[r - l]) % mod1) + mod1) % mod1;
        const T h2 = (((accum_hash2[r] - accum_hash2[l] * pow2[r - l]) % mod2) + mod2) % mod2;
        return make_pair(h1, h2);
    }

private:
    T getRand1()
    {
        static uniform_int_distribution<T> dist{2, mod1 - 1};
        return dist(mt);
    }
    T getRand2()
    {
        static uniform_int_distribution<T> dist{2, mod2 - 1};
        return dist(mt);
    }

    const int size;
    mt19937 mt;
    const T base1;
    const T base2;
    vector<T> pow1;
    vector<T> pow2;
    vector<T> accum_hash1;
    vector<T> accum_hash2;
};


int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);

    mt19937 mt{random_device{}()};
    constexpr ll mod1 = 1000000007;
    constexpr ll mod2 = 1000000009;
    uniform_int_distribution<ll> d1{2, mod1 - 1};
    uniform_int_distribution<ll> d2{2, mod2 - 1};
    const ll base1 = d1(mt);
    const ll base2 = d2(mt);

    string s;
    cin >> s;
    RollingHash<string, ll, mod1, mod2> s_hash(s, base1, base2);
    int M;
    cin >> M;
    using P = pair<ll, ll>;
    constexpr int SIZE = 10;
    vector<set<P>> subs(SIZE + 1);
    for (int i = 1; i <= SIZE; i++) {
        for (int j = 0; j + i - 1 < s.size(); j++) {
            subs[i].insert(s_hash.getHash(j, i + j));
        }
    }


    int num = 0;
    for (int i = 0; i < M; i++) {
        string c;
        cin >> c;
        const int sz = c.size();
        const P v = RollingHash<string, ll, mod1, mod2>{c, base1, base2}.getHash(0, sz);
        if (subs[sz].find(v) != subs[sz].end()) {
            num++;
        }
    }
    cout << num << endl;
    return 0;
}
0