[KMP DP 矩阵快速幂加速] BZOJ 1009 [HNOI2008]GT考试

%%%jiry_2

把 KMP 的 DFA 建出来，相当于求长度为 n 的不经过 m 号点的路径条数。
矩阵乘法。
时间复杂度 O(n3logn)

#include<cstdio>
#include<cstdlib>
#include<algorithm>
using namespace std;

const int N=25;

int n,m,P;

struct Matrix{
	int n,a[N][N];
	Matrix(int in=0,int f=0){
		n=in; for (int i=0;i<=n;i++) for (int j=0;j<=n;j++) a[i][j]=0;
		if (f==1) for (int i=0;i<=n;i++) a[i][i]=1; 
	}
	int *operator [](int x){
		return a[x];
	}
	friend Matrix operator * (Matrix &A,Matrix &B) {
		int n=A.n; Matrix ret(n);
		for (int i=0;i<=n;i++)	
			for (int j=0;j<=n;j++)
				for (int k=0;k<=n;k++)
					(ret[i][j]+=A[i][k]*B[k][j]%P)%=P;
		return ret;
	}
	friend Matrix Pow(Matrix &A,int b){
		Matrix ret(A.n,1);
		for (;b;b>>=1,A=A*A)
			if (b&1)
				ret=ret*A;
		return ret;
	}
}A;

char str[N];
int next[N];
int ch[N][10],f[N];

inline void Init(){
	int k=0; next[1]=0;
	for (int i=2;i<=m;i++){
		while (k && str[i]!=str[k+1]) k=next[k];
		if (str[i]==str[k+1]) k++;
		next[i]=k;
	}
	for (int i=1;i<=m;i++)
		ch[i-1][str[i]-'0']=i;
	for (int i=1;i<=m;i++)
		for (int j=0;j<10;j++)
		{
			int v=ch[i][j];
			if (!v) 
				ch[i][j]=ch[next[i]][j];
		}
}

int main()
{
	freopen("t.in","r",stdin);
	freopen("t.out","w",stdout);
	scanf("%d%d%d",&n,&m,&P);
	scanf("%s",str+1);
	Init();
	A=Matrix(m);
	for (int i=0;i<m;i++)
		for (int j=0;j<10;j++)
			A[ch[i][j]][i]++;
	A=Pow(A,n);
	int ans=0;
	for (int i=0;i<m;i++)
		(ans+=A[i][0])%=P;
	printf("%d\n",ans);
	return 0;
}