题解:
广搜+哈希,水题。
代码如下:
#include<cstdio>
#include<cstring>
using namespace std;
const int maxn=65540,flg[4][2]={{-1,0},{0,1},{1,0},{0,-1}};
int step[maxn],t;
bool que[maxn][5][5],b[5][5],hsh[maxn];
inline int read(){
char ch=getchar();
while (ch!='0'&&ch!='1') ch=getchar();
return ch-'0';
}
int sum(bool b[5][5]){
int ans=0,k=1;
for (int i=1;i<=4;i++)
for (int j=1;j<=4;j++) ans+=k*b[i][j],k<<=1;
return ans;
}
void bfs(){
hsh[sum(que[1])]=1;
int head=0,tail=1;
while (head!=tail) {
head++;
for (int i=1;i<=4;i++)
for (int j=1;j<=4;j++)
if (que[head][i][j])
for (int k=0;k<4;k++) {
int i1=i+flg[k][0],j1=j+flg[k][1];
if (i1>4||i1<1||j1<1||j1>4||que[head][i1][j1]) continue;
que[head][i][j]=0,que[head][i1][j1]=1;
int x=sum(que[head]);
if (hsh[x]==1) {que[head][i][j]=1,que[head][i1][j1]=0; continue;} else hsh[x]=1;
if (x==t) {printf("%d\n",step[head]+1); return;}
step[++tail]=step[head]+1; memcpy(que[tail],que[head],sizeof(que[tail]));
que[head][i][j]=1,que[head][i1][j1]=0;
}
}
}
int main(){
for (int i=1;i<=4;i++)
for (int j=1;j<=4;j++) que[1][i][j]=read();
for (int i=1;i<=4;i++)
for (int j=1;j<=4;j++) b[i][j]=read();
t=sum(b);
if (sum(que[1])==t) {printf("0\n"); return 0;}
bfs();
return 0;
}