【AC自动机】【bzoj 1030】: [JSOI2007]文本生成器

http://www.lydsy.com/JudgeOnline/problem.php?id=1030

大水B题啊

//#define _TEST _TEST
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <cmath>
#include <algorithm>
#include <queue>
using namespace std;
/************************************************
Code By willinglive    Blog:http://willinglive.cf
************************************************/
#define rep(i,l,r) for(int i=(l),___t=(r);i<=___t;i++)
#define per(i,r,l) for(int i=(r),___t=(l);i>=___t;i--)
#define MS(arr,x) memset(arr,x,sizeof(arr))
#define LL long long
#define INE(i,u,e) for(int i=head[u];~i;i=e[i].next)
inline const int read()
{int r=0,k=1;char c=getchar();for(;c<'0'||c>'9';c=getchar())if(c=='-')k=-1;
for(;c>='0'&&c<='9';c=getchar())r=r*10+c-'0';return k*r;}
/
int n,m;
char str[101];
struct node{
	node *next[26],*fail;
	int id;
	bool isword;
	void init(){MS(next,0);fail=0;isword=0;}
}*root,T[6000];
int cntNode;

int dp[101][6000];
/
node* newNode()
{
	T[++cntNode].init();
	T[cntNode].id=cntNode;
	return &T[cntNode];
}
void insert(char *p)
{
	node *o=root;
	for(;*p;p++)
	{
		int son=*p-'A';
		if(o->next[son]==NULL) o->next[son]=newNode();
		o=o->next[son];
	}
	o->isword=1;
}
void ACMatch()
{
	static queue<node*>q;
    q.push(root); root->fail=0;
    while(!q.empty())
    {
    	node *o=q.front(); q.pop();
    	rep(i,0,25)
    	    if(o->next[i])
    	    {
    	    	if(o==root) o->next[i]->fail=root;
    	    	else
    	    	{
    	    		o->next[i]->fail=o->fail->next[i];
    	    		if(o->next[i]->fail->isword) o->next[i]->isword=1;
    	    	}
    	    	q.push(o->next[i]);
    	    }
    	    else
    	    {
    	    	if(o==root) o->next[i]=root;
    	    	else o->next[i]=o->fail->next[i];
    	    }
    }
}
int pow_mod(int a,int b,int p){int t=1;for(;b;b>>=1,a=a*a%p)if(b&1)t=t*a%p;return t;}
/
void input()
{
    n=read(); m=read();
    root=newNode();
    rep(i,1,n)
    {
    	scanf("%s",str);
    	insert(str);
    }
}
void solve()
{
	ACMatch();
	dp[0][1]=1;
	rep(i,0,m-1)
	{
		rep(j,1,cntNode) if(!T[j].isword) if(dp[i][j])
		{
			rep(k,0,25) if(T[j].next[k]) if(!T[j].next[k]->isword)
			{
				dp[i+1][T[j].next[k]->id]+=dp[i][j];
				dp[i+1][T[j].next[k]->id]%=10007;
			}
		}
	}
	int ans=0;
	rep(i,1,cntNode)
	    ans=ans+dp[m][i],ans%=10007;
	int tot=pow_mod(26,m,10007);
	ans=(tot-ans)%10007;
	if(ans<0) ans+=10007;
	cout<<ans<<endl;
}
/
int main()
{
    #ifndef _TEST
    freopen("std.in","r",stdin); freopen("std.out","w",stdout);
    #endif
    input(),solve();
    return 0;
}