题目:BZOJ1009.
题目大意:给定一个字符串
S
S
S,求长度为
n
n
n的没有子串为
S
S
S的字符串数量并对
k
k
k取模.
1
≤
∣
S
∣
≤
20
,
1
≤
n
≤
1
0
9
,
1
≤
k
≤
1
0
3
1\leq |S|\leq 20,1\leq n\leq 10^9,1\leq k\leq 10^3
1≤∣S∣≤20,1≤n≤109,1≤k≤103,字符集
Σ
\Sigma
Σ为数字集.
设 f [ i ] [ j ] f[i][j] f[i][j]表示构造了 i i i个字符,且第 i i i个字符与 S S S匹配到第 j j j个字符的方案数,利用KMP可以直接DP.
发现一次转移必然是从 i i i转移到 i + 1 i+1 i+1,而第二维的 j j j的范围又非常小,所以可以直接用矩阵乘法优化DP.
时间复杂度 O ( ∣ S ∣ 3 log n ) O(|S|^3\log n) O(∣S∣3logn).
代码如下:
#include<bits/stdc++.h>
using namespace std;
#define Abigail inline void
typedef long long LL;
#define memset(a) memset(a,0,sizeof(a))
const int N=20,C=10;
int mod;
int add(int a,int b,int p=mod){return a+b>=p?a+b-p:a+b;}
int sub(int a,int b,int p=mod){return a-b<0?a-b+p:a-b;}
int mul(int a,int b,int p=mod){return (LL)a*b%p;}
void sadd(int &a,int b,int p=mod){a=add(a,b,p);}
void ssub(int &a,int b,int p=mod){a=sub(a,b,p);}
void smul(int &a,int b,int p=mod){a=mul(a,b,p);}
struct matrix{
int n,m,mat[N][N];
matrix(int N=0,int M=0){memset(mat);n=N;m=M;}
int *operator [] (const int &p){return mat[p];}
};
matrix Mat_mul(matrix a,matrix b){
matrix res(a.n,b.m);
for (int i=0;i<a.n;++i)
for (int j=0;j<a.m;++j)
for (int k=0;k<b.m;++k)
sadd(res[i][k],mul(a[i][j],b[j][k]));
return res;
}
matrix Mat_power(matrix a,int k){
matrix res(a.n,a.n);
for (int i=0;i<a.n;++i) res[i][i]=1;
for (;k;k>>=1,a=Mat_mul(a,a))
if (k&1) res=Mat_mul(res,a);
return res;
}
int n,m;
char s[N+9];
int nxt[N+9];
void Get_nxt(){
nxt[1]=0;
int j=0;
for (int i=2;i<=m;++i){
for (;j&&s[i]^s[j+1];j=nxt[j]);
nxt[i]=j+=s[i]==s[j+1];
}
}
int Judge(int p,char c){for (;p&&c^s[p+1];p=nxt[p]);return p+(c==s[p+1]);}
matrix ans,go;
void Get_go(){
go.n=go.m=m;
for (int i=0;i<m;++i)
for (int j=0;j<C;++j){
int t=Judge(i,j+'0');
if (t^m) sadd(go[t][i],1);
}
}
int Get_ans(){
int res=0;
ans.n=m;ans.m=1;
ans[0][0]=1;
ans=Mat_mul(Mat_power(go,n),ans);
for (int i=0;i<ans.n;++i) sadd(res,ans[i][0]);
return res;
}
Abigail into(){
scanf("%d%d%d",&n,&m,&mod);
scanf("%s",s+1);
}
Abigail work(){
Get_nxt();
Get_go();
}
Abigail outo(){
printf("%d\n",Get_ans());
}
int main(){
into();
work();
outo();
return 0;
}