ZOJ1008 Gnome Tetravex

 #include <iostream>

using namespace std;

#include <memory.h>

int a[25][4],t[4],diff[25],posi[25];

int tt,n,m;

bool find(int dfs){

int x,y;

x=dfs/n;

y=dfs%n;

if(dfs>=m)

return true;

for(int i=0;i<tt;i++){

if(diff[i]>0){

if(x>0 && a[posi[dfs-n]][2]!=a[i][0]) 

continue;

if(y>0 && a[posi[dfs-1]][1]!=a[i][3])

continue;

posi[dfs]=i;

diff[i]--;

if(find(dfs+1))

return true;

diff[i]++;

}

}

return false;

}

int main()

{

int i,j;

int cases=0;

while(cin>>n && n>0){

cases++;

if(cases!=1)

cout<<endl;

m=n*n;

tt=0;

memset(diff,0,sizeof(diff));

memset(a,0,sizeof(a));

memset(posi,0,sizeof(posi));

for(i=0;i<m;i++){

cin>>t[0]>>t[1]>>t[2]>>t[3];

for(j=0;j<tt;j++){

if(a[j][0]==t[0] && a[j][1]==t[1] && a[j][2]==t[2] && a[j][3]==t[3]){

diff[j]++;

break;

}

}

if(j>=tt){

a[tt][0]=t[0];

a[tt][1]=t[1];

a[tt][2]=t[2];

a[tt][3]=t[3];

diff[tt]++;

tt++;

}

}

if(find(0))

cout<<"Game "<<cases<<": Possible"<<endl;

else

cout<<"Game "<<cases<<": Impossible"<<endl;

}

return 0;

}