#121772 (C++14) No.430 文字列検索

• 問題: No.430 文字列検索
• ユーザー: sekiya9311
• 提出日時: 2016-10-05 11:26:05
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 17 ms / 2,000 ms
• コード長: 2,752 bytes
• コンパイル時間: 1,430 ms
• コンパイル使用メモリ: 113,372 KB
• 実行使用メモリ: 8,064 KB
• 最終ジャッジ日時: 2024-11-10 00:09:22
• 合計ジャッジ時間: 1,721 ms
• ジャッジサーバーID （参考情報）: judge1 / judge4

ファイルパターン	結果
sample	AC * 4
other	AC * 14

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <bitset>
#include <ctime>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cassert>
#include <cstddef>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <sstream>
#include <fstream>
#include <random>
#define REP(i, n) for (int (i) = 0; (i) < (n); (i)++)
#define FOR(i, a, b) for (int (i) = (a); (i) < (b); (i)++)
#define RREP(i, a) for(int (i) = (a)-1; (i) >= 0; (i)--)
#define FORR(i, a, b) for(int (i) = (a)-1; (i) >= (b); (i)--)
#define PI acos(-1.0)
#define DEBUG(C) cerr << C << endl;
#define VI vector <int>
#define VII vector <VI>
#define VL vector <LL>
#define VLL vector <VL>
#define VD vector <double>
#define VDD vector <VD>
#define PII pair <int, int>
#define PDD pair <double, double>
#define PLL pair <LL, LL>
#define VPII vector <PII>
#define ALL(a) (a).begin(), (a).end()
#define SORT(a) sort(ALL(a))
#define REVERSE(a) reverse(ALL(a))
#define MP make_pair
#define EB emplace_back
#define FORE(a, b) for (auto &&a:b)
#define FIND(s, n) (s.find(n) != s.end())
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
const int INF = 1e9;
const int MOD = INF + 7;
const LL LLINF = 1e18;
template<typename T = int>
class Trie {
private:
    struct Node {
        Node *nxt[26];
        T w = 0;
    };
    Node root;
public:
    Trie() {
        root = Node();
        for (int i = 0; i < 26; i++) {
            root.nxt[i] = nullptr;
        }
    }
    void insert(const string& str, T w = 1) {
        Node *now;
        now = &this->root;
        for (const char c : str) {
            if (now->nxt[c - 'A'] == nullptr) {
                now->nxt[c - 'A'] = new Node();
            }
            now = now->nxt[c - 'A'];
        }
        now->w = w;
    }
    void make(const vector <pair<string, T>>& v) {
        for (pair<string, T> &&p : v) {
            inesrt(p.first, p.second);
        }
    }
    int search(const string& str) {
        Node *now;
        now = &this->root;
        for (const char c : str) {
            if (now->nxt[c - 'A'] == nullptr) return 0;
            now = now->nxt[c - 'A'];
        }
        return now->w;
    }
};
int main(void) {
    Trie <int> t;
    string S; cin >> S;
    int M; cin >> M;
    REP(i, M) {
        string s;
        cin >> s;
        t.insert(s);
    }
    int ans = 0;
    REP(i, 10) {
        REP(j, (int)S.length() - i) {
            ans += t.search(S.substr(j, i + 1));
        }
    }
    cout << ans << endl;
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX