neerc2006 细胞自动机

题目大意：给定n个数首尾相连成一个环。给定距离d，每次计算出左右距离<=d包括本身的数字的和再对m取模，形成新的环。求计算k次之后的环。

题目分析：bzoj2510简化版。直接构造出转移的01矩阵，降维之后直接相乘即可。

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<functional>
#include<cmath>
#include<cctype>
#include<cassert>
#include<climits>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define Forp(x) for(int p=pre[x];p;p=next[p])
#define RepD(i,n) for(int i=n;i>=0;i--)
#define MEM(a) memset(a,0,sizeof(a))
#define MEMI(a) memset(a,127,sizeof(a))
#define MEMi(a) memset(a,128,sizeof(a))
#define INF (2139062143)
#define phiF (1000000006)
#define MAXN (1000000+10)
typedef long long LL;
LL a[505],b[505],c[505];
int n,m,d,k;

int main(){
	scanf("%d%d%d%d",&n,&m,&d,&k);
	For (i,d+1) b[i]=1;
	Fork (i,n-d+1,n) b[i]=1;
	a[1]=1;
	while (k){
		if (k%2) {
			MEM(c);
			For (i,n)
			 For (j,n)
			 (c[i]+=b[j]*a[(i-j+n)%n+1])%=m;
			For (i,n) a[i]=c[i];
		}
		k/=2;
		MEM(c);
		For (i,n)
			For (j,n)
			(c[i]+=b[j]*b[(i-j+n)%n+1])%=m;
		For (i,n) b[i]=c[i];
	}
	For (i,n) 
	 scanf("%lld",&b[i]);
	MEM(c);
	For (i,n)
		For (j,n)
		(c[i]+=b[j]*a[(i-j+n)%n+1])%=m;
	For (i,n)
	printf("%lld ",c[i]);
}