x./AC自动机

前置：：trie , kmp

AC自动机

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;const int MAXN = 2e5 + 5; // 模式串长度之和int tr[MAXN][26], fail[MAXN], tot = 0;
int e[MAXN], sum[MAXN];
vector<int> G[MAXN];
int ins(string s) {int u = 0;for (auto ch : s) {int c = ch - 'a';if (!tr[u][c])tr[u][c] = ++tot;u = tr[u][c];}return u;
}
void bfs() {queue<int> q;for (int c = 0; c < 26; c++)if (tr[0][c])q.push(tr[0][c]);while (!q.empty()) {int u = q.front(); q.pop();for (int c = 0; c < 26; c++)if (tr[u][c]) {fail[tr[u][c]] = tr[fail[u]][c];q.push(tr[u][c]);} elsetr[u][c] = tr[fail[u]][c];}
}int main() { ios::sync_with_stdio(0); cin.tie(0);int n; cin >> n; for (int i = 1; i <= n; i++) {string s; cin >> s;e[i] = ins(s);}bfs();for (int u = 1; u <= tot; u++)G[fail[u]].push_back(u);string t; cin >> t;int u = 0;for (auto ch : t) {int c = ch - 'a';u = tr[u][c];sum[u]++;}auto dfs = [&](int u, auto&& self) -> void {for (auto v : G[u]) {self(v, self);sum[u] += sum[v];}};dfs(0, dfs);for (int i = 1; i <= n; i++)cout << sum[e[i]] << '\n';return 0;
}