WA #2 求调

#include<bits/stdc++.h>
#define il inline
#define rg register
#define ll long long
//#define int long long
using namespace std;

int n,tr[1000001][27],fail[1000001],e[1000001],cnt=0;

string t;

il void add(rg string ikun){
	rg int now=0;
	for(rg int i=0;i<ikun.size();++i){
		if(!tr[i][ikun[i]-'a'])
			tr[i][ikun[i]-'a']=++cnt;
		now=tr[i][ikun[i]-'a'];
	}
	++e[now];
}

il void build(){
	rg queue<int>q;
	for(rg int i=0;i<26;++i)
		if(tr[0][i])
			fail[tr[0][i]]=0,q.push(tr[0][i]);
	while(q.size()){
		rg int u=q.front();
		q.pop();
		for(rg int i=0;i<26;++i)
			if(tr[u][i])
				fail[tr[u][i]]=tr[fail[u]][i],q.push(tr[u][i]);
			else
				tr[u][i]=tr[fail[u]][i];
	}
}

il int query(rg string ikun){
	rg int u=0,res=0;
	for(rg int i=0;i<ikun.size();++i){
		u=tr[u][ikun[i]-'a'];
		for(rg int j=u;j&&e[j]!=-1;j=fail[j]){
			res+=e[j],e[j]=-1;
		}
	}
	return res;
}

signed main(){
	ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
	cin>>n;
	for(rg int i=1;i<=n;++i)
		cin>>t,add(t);
	build();
	fail[0]=0;
	cin>>t;
	cout<<query(t)<<endl;
	return 0;
}