P7456【模板】AC 自动机（二次加强版）ACAM

ACAM 就是结合trie 和 border 树的优点

引入 fail指针 跟 KMP的next指针有点相似
根据势能均摊 和trie的复杂度近似

我们不用while 跳 fail链

                if(trie[u].son[i]) {
					trie[v].fail = fa;
					g[fa].push_back(v);
					q.push(v);
				} else {
					trie[u].son[i] = trie[trie[u].fail].son[i];
				}

#include <bits/stdc++.h>
using namespace  std;
//#define  int long long
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define fi first
#define se second
#define pb  push_back
#define inf 1<<62
#define endl "\n"
#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))
#define de_bug(x) cerr << #x << "=" << x << endl
#define all(a) a.begin(),a.end()
#define IOS   std::ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define  fer(i,a,b)  for(int i=a;i<=b;i++)
#define  der(i,a,b)  for(int i=a;i>=b;i--)
const int mod = 1e9 + 7;
const int N = 3e5 + 10;
int ans[N];
struct acam {
	struct node {
		int fail;
		int son[26] = {};
	} trie[N];
	int idx = 0;
	map<int, int>mp;
	vi g[N];
	void insert(string &s, int id) {
		int u = 0;
		for(auto c : s) {
			if(!trie[u].son[c - 'a']) {
				trie[u].son[c - 'a'] = ++idx;
			}
			u = trie[u].son[c - 'a'];
		}
		mp[id] = u;
	}

	void build() {
		queue<int>q;
		for(int i = 0; i <= 25; i++) {
			if(trie[0].son[i]) {
				q.push(trie[0].son[i]);
			}
		}
		while(!q.empty()) {
			int u = q.front();
			q.pop();
			for(int i = 0; i <= 25; i++) {
				int v = trie[u].son[i], fa = trie[trie[u].fail].son[i];
				if(trie[u].son[i]) {
					trie[v].fail = fa;
					g[fa].push_back(v);
					q.push(v);
				} else {
					trie[u].son[i] = trie[trie[u].fail].son[i];
				}

			}
		}
	}
	void query(string &s) {
		int u = 0;
		for(auto v : s) {
			u = trie[u].son[v - 'a'];
			ans[u]++;
		}
	}
	void dfs(int u) {
		for(auto v : g[u]) {
			dfs(v);
			ans[u] += ans[v];
		}
	}
	void solve(string &s) {
		query(s);
		for(int i = 0; i <= 25; i++) {
			if(trie[0].son[i]) {
				dfs(trie[0].son[i]);
			}
		}
	}

} ACTree;
void solve() {
	int n;
	cin >> n;
	for(int i = 1; i <= n; i++) {
		string s;
		cin >> s;
		ACTree.insert(s,i);
	}

	ACTree.build();
	string s;
	cin >> s;
	ACTree.solve(s);
	for(int i = 1; i <= n; i++) {
		cout << ans[ACTree.mp[i]] << endl;
	}
}


int main() {
	IOS;
	int _ = 1;
	//cin>>_;
	while( _-- )
		solve();
}