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
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
| #include <cstdio>
#include <cstring>
#include <cstdlib>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cctype>
#include <iostream>
#include <bitset>
#include <queue>
#include <climits>
using namespace std;
char ch[2505][1105];
int vis[3000], n;
const int SIGMA = 26;
struct Node {
int id, cnt;
struct Node *next[SIGMA], *fail;
Node() { id = 0, memset(next, 0, sizeof(next)); }
} *root;
inline int getIndex(char c) { return c - 'A'; }
inline void insert(const char *s, int t) {
register int i = 0;
Node *p = root;
while (s[i]) {
if (!p->next[getIndex(s[i])]) p->next[getIndex(s[i])] = new Node();
p = p->next[getIndex(s[i])];
i++;
}
p->id = 1, p->cnt = t;
}
inline void build() {
root->fail = root;
std::queue<Node *> q;
q.push(root);
while (!q.empty()) {
Node *t = q.front(); q.pop();
Node *p = 0;
for (int i = 0; i < SIGMA; i++) {
if (t->next[i] != 0) {
if (t == root) t->next[i]->fail = root;
else {
p = t->fail;
while (p != root && p->next[i] == 0) p = p->fail;
if (p->next[i]) t->next[i]->fail = p->next[i];
else t->next[i]->fail = root;
}
q.push(t->next[i]);
}
}
}
}
inline int bfs(char *s) {
register int i = 0, sum = 0, len = strlen(s);
Node *p = root;
while (s[i]) {
while (p->next[getIndex(s[i])] == 0 && p != root) p = p->fail;
p = (p->next[getIndex(s[i])] == 0) ? root : p->next[getIndex(s[i])];
Node *t = p;
while (t != root && t->id != -3) {
if (abs(t->id) == 1 && vis[t->cnt]) vis[t->cnt] = 0;
t->id = -3, t = t->fail;
}
i++;
}
}
inline int solve(char *s) {
register int i = 0, sum = 0;
Node *p = root;
while (s[i]) {
while (p->next[getIndex(s[i])] == 0 && p != root) p = p->fail;
p = (p->next[getIndex(s[i])] == 0) ? root : p->next[getIndex(s[i])];
Node *t = p;
while (t != root && t->id != -4) {
if (abs(t->id) == 1) sum ++;
t->id = -4, t = t->fail;
}
i++;
}
return sum;
}
inline int query(char *s) {
register int i = 0, sum = 0;
Node *p = root;
while (s[i]) {
while (p->next[getIndex(s[i])] == 0 && p != root) p = p->fail;
p = (p->next[getIndex(s[i])] == 0) ? root : p->next[getIndex(s[i])];
Node *t = p;
while (t != root && t->id >= 0) {
if (t->id == 1) vis[t->cnt] = 1, t->id = -1;
else t->id = -2;
t = t->fail;
}
i++;
}
for (register int i = 1; i <= n; i++)
if (vis[i])
bfs(ch[i]), insert(ch[i], i);
sum = solve(s);
return sum;
}
char str1[5100009], str2[5100009];
int main() {
register int m, T, i, j;
scanf("%d", &T);
while (T--) {
memset(vis, 0, sizeof(vis));
root = new Node();
scanf("%d", &n);
for (register int t = 1; t <= n; t++) {
scanf("%s", str1 + 1);
for (i = 1, j = 1; str1[i]; i++) {
if (str1[i] >= 'A' && str1[i] <= 'Z') str2[j++] = str1[i];
else {
i++;
register int k = str1[i] - '0';
i++;
while (str1[i] < 'A' || str1[i] > 'Z') k = (k << 1) + (k << 3) + (str1[i++] ^ '0');
while (k--) str2[j++] = str1[i];
i++;
}
}
str2[j] = '\0', strcpy(ch[t], str2 + 1), insert(str2 + 1, t);
}
build();
scanf("%s", str1 + 1);
for (i = 1, j = 1; str1[i]; i++) {
if (str1[i] >= 'A' && str1[i] <= 'Z') str2[j++] = str1[i];
else {
i++;
register int k = str1[i] - '0';
i++;
while (str1[i] < 'A' || str1[i] > 'Z') k = (k << 1) + (k << 3) + (str1[i++] ^ '0');
while (k--) str2[j++] = str1[i];
i++;
}
}
str2[j] = '\0';
register int ans = query(str2 + 1);
printf("%d\n", ans);
}
return 0;
}
|
