From Evernote:

uva 11581

有點狀態壓縮的感覺

[sourcecode language="cpp"]
//============================================================================
// Name : Grid Successors.cpp
// Date : 2013 2013/2/23 上午11:37:42
// Author : GCA
//============================================================================
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
using namespace std;
typedef long long ll;
typedef unsigned int uint;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\n")
#define I_de(x,n)for(int i=0;i<n;i++)printf("%d ",x[i]);Pln()
#define De(x)printf(#x"%d\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\
printf("%d ",dp[htx][hty]);}Pln();}
#define M 100005
#define PII pair<int,int>
#define PB push_back
#define oo INT_MAX
#define Set_oo 0x3f
#define Is_debug true
#define debug(...) if(Is_debug)printf("DEBUG: "),printf(__VA_ARGS__)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define eps 1e-6
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
int tmp=min(x,y);
return min(tmp,z);
}
int max3(int x,int y,int z){
int tmp=max(x,y);
return max(tmp,z);
}
int mz[3][3];
int dx[4]={0,0,-1,1},dy[4]={-1,1,0,0};
int dp[2000];
int convert(int m[][3]){
int d=0;
for(int i=0;i<3;i++){
for(int j=0;j<3;j++){
if(m[j][i])d|=(1<<(j+3*i));
}
}
return d;
}
void solve(){
int t=convert(mz);
int newmz[3][3];
dp[t]=1;
// printf("t%d \n",t);
// for(int ii=0;ii<9;ii++){
// printf("%d",(convert(mz)>>ii)&1);
// }Pln();
int f;
for(f=0;f<2000;f++){
memcpy(newmz,mz,sizeof(mz));
for(int i=0;i<3;i++){
for(int j=0;j<3;j++){
int a=0;
for(int k=0;k<4;k++){
int x=j+dx[k],y=i+dy[k];
if(x>=0&&x<3&&y>=0&&y<3){
a+=newmz[x][y];
}

}
// printf("a%d\n",a);
mz[j][i]=a%2;
}
}
int tmp=convert(mz);
if(dp[tmp])break;
dp[tmp]=1;
// for(int ii=0;ii<9;ii++){
// printf("%d",(tmp>>ii)&1);
// }Pln();
// printf("%d %d\n",f,tmp);
}
printf("%d\n",f-1);
}
int main() {
ios_base::sync_with_stdio(0);

int test;
scanf("%d%*c",&test);
while(test--){
getchar();
Set(dp,0);
Set(mz,0);
for(int i=0;i<3;i++){
for(int j=0;j<3;j++){
char c;
scanf("%c",&c);
mz[j][i]=c-'0';
}
getchar();
}
solve();
}

}

[/sourcecode]