1297: [SCOI2009]迷路

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#define M 100
#define MOD 2009
#define P(i,j) (((j)-1)*m+(i))
using namespace std;
struct Matrix{
int xx[M][M];
Matrix()
{
memset(xx,0,sizeof xx);
}
int* operator [] (int x)
{
return xx[x];
}
}a,map;
int n,m,t;
void operator *= (Matrix &x,Matrix &y)
{
int i,j,k;
Matrix z;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
for(k=1;k<=n;k++)
z[i][j]+=x[i][k]*y[k][j],z[i][j]%=MOD;
x=z;
}
void Quick_Power(int y)
{
static Matrix x=map;
while(y)
{
if(y&1)a*=x;
x*=x;
y>>=1;
}
}
int main()
{
int i,j,x,last;
cin>>m>>t;n=m*9;
for(i=1;i<=m;i++)
for(j=2;j<=9;j++)
map[P(i,j)][P(i,j-1)]=1;
for(i=1;i<=m;i++)
for(j=1;j<=m;j++)
{
scanf("%1d",&x);
if(x==0) continue;
map[i][P(j,x)]=1;
}
for(i=1;i<=n;i++)
a[i][i]=
4000
1;
Quick_Power(t);
printf("%d\n",a[1][m]);
return 0;
}