BZOJ4417 [Shoi2013]超级跳马

做一个3*n的矩阵，前n列表示距离下一行为奇数的每一列的答案的和，中间n列代表偶数的，最后n列代表最后一列的答案

矩阵大致就长这样

然后快速幂就好了

#include<iostream>
#include<cstdlib>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<ctime>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<bitset>
using namespace std;
#define MAXN 210
#define MAXM 30011
#define ll long long
#define INF 1000000000
#define MOD 30011
#define eps 1e-8
int N;
struct mat{
	int x[MAXN][MAXN];
	mat(){
		memset(x,0,sizeof(x));
	}
	friend mat operator *(mat x,mat y){
		mat z;
		int i,j,k;
		for(i=1;i<=N;i++){
			for(j=1;j<=N;j++){
				for(k=1;k<=N;k++){
					(z.x[i][j]+=x.x[i][k]*y.x[k][j])%=MOD;
				}
			}
		}
		return z;
	}
};
int n,m;
mat a,b,c;
int main(){
	int i;
	scanf("%d%d",&n,&m);
	N=n*3;
	a.x[1][1]=1;
	a.x[1][n+n+1]=1;
	for(i=1;i<=n;i++){
		b.x[i][i]=1;
		b.x[n+i][n+i]=1;
		b.x[n+n+i][n+n+i]=1;
		c.x[n+i][i]=1;
		c.x[i][n+i]=1;
		c.x[i][i]=1;
		if(i!=1){
			c.x[i-1][i]=1;
			c.x[i-1][n+n+i]=1;
		}
		if(i!=n){
			c.x[i+1][i]=1;
			c.x[i+1][n+n+i]=1;
		}
		c.x[i][n+n+i]=1;
	}
	m--;
	while(m){
		if(m&1){
			b=b*c;
		}
		c=c*c;
		m>>=1;
	}
	a=a*b;
	printf("%d\n",a.x[1][n+n+n]);
	return 0;
}

/*
3 5
*/