BZOJ3271【AC自动机】

/* I will wait for you */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<ctime>
#include<algorithm>
#include<iostream>
#include<fstream>
#include<vector>
#include<queue>
#include<deque>
#include<set>
#include<map>
#include<string>
#define make make_pair
#define fi first
#define se second

using namespace std;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int,int> PII;

const int maxn=1000010;
const int maxm=1010;
const int maxs=26;
const int INF=1<<29;
const int P=1000000007;
const double error=1e-9;

int cnt=0,next[maxn][maxs],fail[maxn],last[maxn],val[maxn],q[maxn],id[maxn];

int insert(char* s,int v)
{
	int n=strlen(s),p=0;
	for(int i=0;i<n;i++)
	{
		int c=s[i]-'a';
		if(!next[p][c]) next[p][c]=++cnt;
		p=next[p][c];val[p]++;
	}
	id[v]=p;
}
		
int getfail()
{
	int head=1,tail=0,c;
	for(int i=0;i<maxs;i++) if((c=next[0][i])) q[++tail]=c;
	
	while(head<=tail)
	{
		int u=q[head++];
		for(int i=0;i<maxs;i++)
		{
			if(!(c=next[u][i])) next[u][i]=next[fail[u]][i];
			else
			{
				fail[c]=next[fail[u]][i];
				last[c]=val[fail[c]]?fail[c]:last[fail[c]];
				q[++tail]=c;
			}
		}
	}
	
	for(int i=tail;i;i--) val[last[q[i]]]+=val[q[i]]; 
}
	
int main()
{
	int n;char s[maxn];scanf("%d",&n);
	for(int i=0;i<n;i++) scanf("%s",s),insert(s,i);
	
	getfail();for(int i=0;i<n;i++) printf("%d\n",val[id[i]]);

	return 0;
}