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// brute.cpp：小数据暴力解，逐个模式串检查它是否在文本串中出现。
#include <bits/stdc++.h>
using namespace std;

int n;
string pattern_list[105];
string text;

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

    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> pattern_list[i];
    }
    cin >> text;

    int ans = 0;
    for (int i = 1; i <= n; i++) {
        bool found = false;
        int len = (int)pattern_list[i].size();
        for (int l = 0; l + len <= (int)text.size(); l++) {
            bool same = true;
            for (int j = 0; j < len; j++) {
                if (text[l + j] != pattern_list[i][j]) {
                    same = false;
                    break;
                }
            }
            if (same) {
                found = true;
                break;
            }
        }
        if (found) ans++;
    }

    cout << ans << "\n";

    return 0;
}

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#include <bits/stdc++.h>
using namespace std;

const int MAXNODE = 1000005;
const int SIGMA = 26;

int n;
int trie[MAXNODE][SIGMA];
int fail_link[MAXNODE];
int end_count[MAXNODE]; // end_count[u] 表示有多少个模式串在 u 结尾
int node_cnt;
string text;

void insert_pattern(const string &s) {
    int u = 0;
    for (int i = 0; i < (int)s.size(); i++) {
        int c = s[i] - 'a';
        if (trie[u][c] == 0) {
            node_cnt++;
            trie[u][c] = node_cnt;
        }
        u = trie[u][c];
    }
    end_count[u]++;
}

void build_ac_automaton() {
    queue<int> q;
    for (int c = 0; c < SIGMA; c++) {
        int v = trie[0][c];
        if (v != 0) {
            fail_link[v] = 0;
            q.push(v);
        }
    }

    while (!q.empty()) {
        int u = q.front();
        q.pop();

        for (int c = 0; c < SIGMA; c++) {
            int v = trie[u][c];
            if (v != 0) {
                fail_link[v] = trie[fail_link[u]][c];
                q.push(v);
            } else {
                // 补全转移：失配时直接跳到 fail 后能走到的状态。
                trie[u][c] = trie[fail_link[u]][c];
            }
        }
    }
}

long long count_matched_patterns() {
    long long ans = 0;
    int u = 0;

    for (int i = 0; i < (int)text.size(); i++) {
        int c = text[i] - 'a';
        u = trie[u][c];

        // 沿 fail 链统计所有以当前位置结尾的模式串。
        // 统计过的节点标成 -1，保证同一个模式串编号只贡献一次。
        int p = u;
        while (p != 0 && end_count[p] != -1) {
            ans += end_count[p];
            end_count[p] = -1;
            p = fail_link[p];
        }
    }

    return ans;
}

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

    cin >> n;
    for (int i = 1; i <= n; i++) {
        string s;
        cin >> s;
        insert_pattern(s);
    }
    cin >> text;

    build_ac_automaton();
    cout << count_matched_patterns() << "\n";

    return 0;
}