标签：
#include<queue> #include<cstdio> #include<cstring> #include<algorithm> using namespace std; const int bi=1e8; const int MAXN=531441; int i; struct na{ int x,z; na(int xx,int zz):x(xx),z(zz){} }; int n,m,x,y,z,a[21],k,p1,p2,en,t; bool map[14][14]; long long f[2][MAXN+1],ans; int v[2][MAXN+1]; queue <na> q; inline int gx(int x,int q1,int q2){k=0;for (register int i=m+1;i;i--) k=k*3+(i==x?q1:(i==x+1?q2:a[i]));return k;} inline void up(int x,int z,long long lj){ x++; k=x%2; if (v[k][z]!=x) v[k][z]=x,f[k][z]=0,q.push(na(x,z)); f[k][z]=f[k][z]+lj; } char c[10]; int main(){ register int i,j; scanf("%d",&t); for (int u=1;u<=t;u++){ ans=0; memset(map,0,sizeof(map)); memset(v,0,sizeof(v)); scanf("%d%d",&n,&m); for (j=1;j<=n;j++) for (i=1;i<=m;i++) scanf("%d",&map[i][j]); en=n*m-1; while(!map[en%m+1][en/m+1]&&en>0) en--; f[0][0]=v[0][0]=1; q.push(na(0,0)); while(!q.empty()){ na no=q.front();q.pop(); unsigned long long an=f[no.x%2][no.z]; if(no.x%m==0) no.z*=3; x=no.x%m+1;y=no.x/m+1; for (i=1;i<=m+1;i++) a[i]=0; for (i=1,j=no.z;j;i++,j/=3) a[i]=j%3; if (!map[x][y]){ if (no.x==en) ans=ans+an;else up(no.x,gx(x,0,0),an); }else if (a[x]==1&&a[x+1]==2){ if (no.x==en) ans=ans+an; else up(no.x,gx(x,0,0),an);/*多回路*/ }else if (a[x]==2&&a[x+1]==1) up(no.x,gx(x,0,0),an);else if (a[x]==0&&a[x+1]==0){ if (map[x][y+1]&&map[x+1][y]) up(no.x,gx(x,1,2),an); }else if (a[x]==0){ if (map[x+1][y]) up(no.x,gx(x,0,a[x+1]),an); if (map[x][y+1]) up(no.x,gx(x,a[x+1],0),an); }else if (a[x+1]==0){ if (map[x+1][y]) up(no.x,gx(x,0,a[x]),an); if (map[x][y+1]) up(no.x,gx(x,a[x],0),an); }else if (a[x]==a[x+1]){ p1=p2=0; if (a[x]==1) for (j=0,i=x+2;i<=m;i++){ if (a[i]==1) j--; if (a[i]==2) j++; if (j>0&&!p1) p1=i,j--; if (j>0&&p1){p2=i;break;} }else for (j=0,i=x-1;i;i--){ if (a[i]==1) j++; if (a[i]==2) j--; if (j>0&&!p2) p2=i,j--; if (j>0&&p2){p1=i;break;} } a[p1]=1;a[p2]=2;up(no.x,gx(x,0,0),an); } } printf("Case %d: There are %I64d ways to eat the trees.\n",u,ans); } }
标签：
原文地址：http://www.cnblogs.com/Enceladus/p/5137160.html
