[AC自动机 DP] BZOJ 1030 [JSOI2007] 文本生成器

AC自动机上DP

算模板题吧

#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cstring>
#include<queue>
#define cl(x) memset(x,0,sizeof(x))
using namespace std;

inline char nc()
{
	static char buf[100000],*p1=buf,*p2=buf;
	if (p1==p2) { p2=(p1=buf)+fread(buf,1,100000,stdin); if (p1==p2) return EOF; }
	return *p1++;
}

inline void read(int &x)
{
	char c=nc(),b=1;
	for (;!(c>='0' && c<='9');c=nc()) if (c=='-') b=-1;
	for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;
}

inline int read(char *s)
{
	char c=nc(); int len=0;
	for (;!(c>='A' && c<='Z');c=nc());
	for (;c>='A' && c<='Z';s[++len]=c,c=nc()); s[++len]=0; return len-1;
}

const int M=10005;

int ncnt,root,ch[M][26];
int val[M],f[M];

inline void Insert(char *str,int len){
	int p=root;
	for (int i=1;i<=len;i++)
	{
		if (!ch[p][str[i]-'A']) ch[p][str[i]-'A']=++ncnt;
		p=ch[p][str[i]-'A'];
	}
	val[p]++;
}

queue<int> Q;

inline void GetFail(){
	f[0]=0; int u,v,t;
	for (int i=0;i<26;i++)
		if (ch[0][i])
			f[ch[0][i]]=0,Q.push(ch[0][i]);
	while (!Q.empty()){
		u=Q.front(); Q.pop();
		for (int i=0;i<26;i++)
		{
			v=ch[u][i];
			if (!v) { ch[u][i]=ch[f[u]][i]; continue; }
			Q.push(v);
			f[v]=ch[f[u]][i];
			val[v]|=val[f[v]];
		}
	}
}

const int P=10007;

inline int Pow(int a,int b){
	int ret=1;
	for (;b;b>>=1,a=a*a%P)
		if (b&1)
			ret=ret*a%P;
	return ret;
}

int ans=0;
int n,m;

int dp[105][M];

int main()
{
	int T,len; char str[105];
	freopen("t.in","r",stdin);
	freopen("t.out","w",stdout);
	read(n); read(m);
	for (int i=1;i<=n;i++)
	{
		len=read(str);
		Insert(str,len);
	}
	GetFail();
	ans=Pow(26,m);
	dp[0][0]=1;
	for (int i=0;i<m;i++)
		for (int j=0;j<=ncnt;j++)
			if (!val[j])
				for (int k=0;k<26;k++)
					(dp[i+1][ch[j][k]]+=dp[i][j])%=P;
	for (int i=0;i<=ncnt;i++)
		if (!val[i])
			ans+=P-dp[m][i],ans%=P;
	printf("%d\n",ans);
	return 0;
}