[JSOI2007]文本生成器

AC自动机上DP

f[i][j]表示(从根)走i步(串长为i)到节点j的方案数

感觉从Trie图的角度更好理解一些(在安全图中走i步的方案数)

#include <cstdio>
#include <queue>
#include <cstring>
using namespace std;
#define MOD 10007
#define N 60
#define L (100+1)
#define type 26
#define Min 'A'
struct node
{
	node *fail, *s[type];
	bool danger;
}T[N*L], *R;
queue<node*> Q;
int n, m, l(0), tot(0), f[L][N*L] = {0}, ans(0), hh(0);
char c, a[L];
inline void insert(char *str)
{
	node *p = R;
	for (int i = 0;i < l; ++i)
	{
		int now = str[i]-Min;
		if (!p->s[now])
			p->s[now] = &T[tot++];
		p = p->s[now];
	}
	p->danger++;
}
inline void build()
{
	for (int i = 0;i < type; ++i)
		if (R->s[i])
			R->s[i]->fail = R, Q.push(R->s[i]);
		else
			R->s[i] = R;
	while (!Q.empty())
	{
		node *u = Q.front();
		Q.pop();
		for (int i = 0;i < type; ++i)
		{
			if (u->s[i])
			{
				u->s[i]->fail = u->fail->s[i];
				u->s[i]->danger |= u->s[i]->fail->danger;
				Q.push(u->s[i]);
			}
			else
				u->s[i] = u->fail->s[i];
		}
	}
}
inline void dp(int i)
{
	for (int j = 0;j < tot; ++j)
	{
		if (T[j].danger)continue;
		for (int k = 0;k < type; ++k)
			f[i+1][T[j].s[k]-T] += f[i][j], f[i+1][T[j].s[k]-T] %= MOD;
	}
}
int main()
{
	scanf("%d %d ", &n, &m);
	R = &T[tot++], hh = 1;
	for (int i = 1;i <= m; ++i)hh = hh * type % MOD;
	for (int i = 0;i < n;l = 0, ++i)
	{
		for (c = getchar();c != '\n';c = getchar())a[l++] = c;
		insert(a); 
	}
	build();
	f[0][0] = 1;
	for (int i = 0;i < m; ++i)dp(i);
	for (int i = 0;i < tot; ++i)
		ans += f[m][i] * !T[i].danger, ans %= MOD;
	printf("%d\n", (hh+MOD-ans)%MOD);
}