#589276 (C++17) No.430 文字列検索

• 問題: No.430 文字列検索
• ユーザー: haruki_K
• 提出日時: 2020-12-04 21:51:22
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 278 ms / 2,000 ms
• コード長: 8,565 bytes
• コンパイル時間: 2,162 ms
• コンパイル使用メモリ: 218,640 KB
• 実行使用メモリ: 27,852 KB
• 最終ジャッジ日時: 2024-11-10 00:51:00
• 合計ジャッジ時間: 3,648 ms
• ジャッジサーバーID （参考情報）: judge3 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	278 ms; 27,852 KB
testcase_02	AC	20 ms; 5,248 KB
testcase_03	AC	21 ms; 5,248 KB
testcase_04	AC	2 ms; 5,248 KB
testcase_05	AC	2 ms; 5,248 KB
testcase_06	AC	2 ms; 5,248 KB
testcase_07	AC	2 ms; 5,248 KB
testcase_08	AC	260 ms; 27,596 KB
testcase_09	AC	1 ms; 5,248 KB
testcase_10	AC	14 ms; 5,640 KB
testcase_11	AC	60 ms; 8,656 KB
testcase_12	AC	59 ms; 8,912 KB
testcase_13	AC	60 ms; 8,912 KB
testcase_14	AC	52 ms; 7,120 KB
testcase_15	AC	44 ms; 6,348 KB
testcase_16	AC	27 ms; 5,248 KB
testcase_17	AC	23 ms; 5,248 KB

ソースコード

// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
#define int ll
#define double ld
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define rep1(i,n) for (int i = 1; i <= (int)(n); i++)
#define repR(i,n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i,n) for (int i = (int)(n); i >= 1; i--)
#define loop(i,a,B) for (int i = a; i B; i++)
#define loopR(i,a,B) for (int i = a; i B; i--)
#define all(x) begin(x), end(x)
#define allR(x) rbegin(x), rend(x)
#define rng(x,l,r) begin(x) + (l), begin(x) + (r)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
template <class Int> auto constexpr inf = numeric_limits<Int>::max()/2-1;
auto constexpr INF32 = inf<int32_t>;
auto constexpr INF64 = inf<int64_t>;
auto constexpr INF   = inf<int>;
#ifdef LOCAL
#include "debug.hpp"
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T, class Comp> struct pque : priority_queue<T, vector<T>, Comp> {
    vector<T> &data() { return this->c; }
    void clear() { this->c.clear(); }
};
template <class T> using pque_max = pque<T, less<T>>;
template <class T> using pque_min = pque<T, greater<T>>;
template <class T, class = typename T::iterator, enable_if_t<!is_same<T, string>::value, int> = 0>
ostream& operator<<(ostream& os, T const& a) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, size_t N, enable_if_t<!is_same<T, char>::value, int> = 0>
ostream& operator<<(ostream& os, const T (&a)[N]) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = decltype(begin(declval<T&>())), class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &a) { for (auto& x : a) is >> x; return is; }
template <class T, class S> ostream& operator<<(ostream& os, pair<T,S> const& p) { return os << p.first << " " << p.second; }
template <class T, class S> istream& operator>>(istream& is, pair<T,S>& p) { return is >> p.first >> p.second; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
    constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
    template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint { template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); } };
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
    using type = vector<typename vec_impl<T,d-1>::type>;
    template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T,d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T,0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T,d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T,d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T, class U> constexpr bool chmin(T& x, U const& y) { if (x > y) { x = y; return true; } return false; }
template <class T, class U> constexpr bool chmax(T& x, U const& y) { if (x < y) { x = y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b, e, typename iterator_traits<It>::value_type{}); }
template <class T> int sz(T const& x) { return x.size(); }
template <class C, class T> int lbd(C const& v, T const& x) { return lower_bound(begin(v), end(v), x)-begin(v); }
template <class C, class T> int ubd(C const& v, T const& x) { return upper_bound(begin(v), end(v), x)-begin(v); }
const int dx[] = { 1,0,-1,0,1,-1,-1,1 };
const int dy[] = { 0,1,0,-1,1,1,-1,-1 };
constexpr int popcnt(ll x) { return __builtin_popcountll(x); }
// [a,b]
template <class Int> Int rand(Int a, Int b) { static mt19937_64 mt{random_device{}()}; return uniform_int_distribution<Int>(a,b)(mt); }
i64 irand(i64 a, i64 b) { return rand<i64>(a,b); }
u64 urand(u64 a, u64 b) { return rand<u64>(a,b); }
// <<<
// >>> hash value
struct Hash {
    using u64 = uint64_t;
    using i32 = int32_t;
    struct mint;
    Hash() {};
    Hash(mint val, i32 len) : val(val), len(len) {}
    // do not use for `const char*'
    template <class Str, class = typename Str::iterator>
    Hash(Str const& s) : val(0), len(0) {
        for (auto c : s) *this = *this + Hash(c);
    }
    template <class Int, enable_if_t<is_integral_v<Int>, int> = 0>
    Hash(Int x) : val(x ^ pow(1).x), len(1) {}
    Hash operator+(Hash const& r) const {
        return { val * pow(r.len) + r.val, len + r.len };
    }
    Hash operator-() const { return { - pow(-len) * val, -len }; }
    Hash operator-(Hash const& r) const { return *this + (-r); }
    bool operator==(Hash const& r) const { return val == r.val && len == r.len; }
    bool operator!=(Hash const& r) const { return !(*this == r); }
    bool operator<(Hash const& r) const {
        return val.x == r.val.x ? len < r.len : val.x < r.val.x;
    }

    static constexpr u64 mod = (1ull<<61) - 1;
    struct mint {
        u64 x;
        constexpr mint(u64 x = 0) : x(x) {
            x = (x & mod) + (x >> 61);
            x = (x < mod ? x : x-mod);
        }
        constexpr bool operator==(mint const& r) const { return x == r.x; }
        constexpr bool operator!=(mint const& r) const { return x != r.x; }
        constexpr mint operator+() const { return *this; }
        constexpr mint operator-() const { return mint()-*this; }
        constexpr mint& operator+=(mint const& r) { x += r.x; x = (x < mod ? x : x-mod); return *this; }
        constexpr mint& operator-=(mint const& r) { x += mod-r.x; x = (x < mod ? x : x-mod); return *this; }
        constexpr mint& operator*=(mint r) { x = mul(x, r.x); return *this; }
        constexpr mint operator+(mint r) const { return mint(*this) += r; }
        constexpr mint operator-(mint r) const { return mint(*this) -= r; }
        constexpr mint operator*(mint r) const { return mint(*this) *= r; }
    };

    mint val = 0;
    i32 len = 0;

    static mint pow(int n) {
        static u64 B = 0, iB = 1;
        if (B == 0) {
            mt19937_64 mt(random_device{}());
            B = uniform_int_distribution<u64>(300, mod-300)(mt);
            u64 k = mod - 2, p = B;
            for ( ; k; k >>= 1, p = mul(p, p)) if (k & 1) iB = mul(iB, p);
        }
        if (n >= 0) {
            static vector<u64> pow(1, 1);
            if (n >= (int)pow.size()) {
                int m = pow.size();
                pow.resize(n + 1);
                for (int i = m; i < n + 1; i++) pow[i] = mul(pow[i-1], B);
            }
            return pow[n];
        } else {
            static vector<u64> pow(1, 1);
            n = -n;
            if (n >= (int)pow.size()) {
                int m = pow.size();
                pow.resize(n + 1);
                for (int i = m; i < n + 1; i++) pow[i] = mul(pow[i-1], iB);
            }
            return pow[n];
        }
    }
    static constexpr u64 mul(u64 a, u64 b) {
        auto val = __uint128_t(a) * b;
        val = (val & mod) + (val >> 61);
        return val >= mod ? val - mod : val;
        // constexpr u64 mask30 = (1ull << 30) - 1;
        // constexpr u64 mask31 = (1ull << 31) - 1;
        // u64 au = a >> 31, ad = a & mask31;
        // u64 bu = b >> 31, bd = b & mask31;
        // u64 mid = ad * bu + au * bd, midu = mid >> 30, midd = mid & mask30;
        // u64 val = au * bu * 2 + midu + (midd << 31) + ad * bd;
        // val = (val & mod) + (val >> 61);
        // return val >= mod ? val - mod : val;
    }
#ifdef LOCAL
    friend string to_s(Hash const& hash) {
        return to_s(make_pair(hash.val.x, hash.len));
    }
#endif
};
// <<<

int32_t main() {
    string s; cin >> s;
    const int n = s.size();
    vector<Hash> sub(n+1);
    repR (i,n) sub[i] = Hash(s[i]) + sub[i+1];

    map<Hash, int> cnt;
    rep1 (len,10) rep (l,n-len+1) {
        cnt[sub[l]-sub[l+len]]++;
    }

    int m; cin >> m;
    int ans = 0;
    rep (_,m) {
        string c; cin >> c;
        ans += cnt[Hash(c)];
    }
    cout << ans << endl;
}