题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1195
此题数据较小可以用一般广搜枚举,一共有4中控制。
代码示例:
#include<stdio.h>
#include<string.h>
#include<iostream>
#include<queue>
using namespace std;
typedef struct
{
int n[4];
int step;
}node;
node fir,nex;
queue<node>Q;
int finf[4],finn[4];
int map[10][10][10][10];
int dir[8][4]={{1,0,0,0},{-1,0,0,0},{0,1,0,0},{0,-1,0,0},{0,0,1,0},{0,0,-1,0},{0,0,0,1},{0,0,0,-1}};
int control(int x)
{
if(x<1)
return 9;
if(x>9)
return 1;
return x;
}
bool judge()
{
if(nex.n[0]>9||nex.n[0]<1||nex.n[1]>9||nex.n[1]<1||nex.n[2]>9||nex.n[2]<1||nex.n[3]>9||nex.n[3]<1)
return true;
if(map[nex.n[0]][nex.n[1]][nex.n[2]][nex.n[3]])
return true;
return false;
}
void build()
{
for(int i=0;i<8;i++)
{
nex.n[0]=control(fir.n[0]+dir[i][0]);
nex.n[1]=control(fir.n[1]+dir[i][1]);
nex.n[2]=control(fir.n[2]+dir[i][2]);
nex.n[3]=control(fir.n[3]+dir[i][3]);
if(judge())
continue;
nex.step=fir.step+1;
map[nex.n[0]][nex.n[1]][nex.n[2]][nex.n[3]]=1;
Q.push(nex);
}
nex.n[0]=fir.n[1],nex.n[1]=fir.n[0],nex.n[2]=fir.n[2],nex.n[3]=fir.n[3];
if(!judge())
{
nex.step=fir.step+1;
map[nex.n[0]][nex.n[1]][nex.n[2]][nex.n[3]]=1;
Q.push(nex);
}
nex.n[0]=fir.n[0],nex.n[1]=fir.n[2],nex.n[2]=fir.n[1],nex.n[3]=fir.n[3];
if(!judge())
{
nex.step=fir.step+1;
map[nex.n[0]][nex.n[1]][nex.n[2]][nex.n[3]]=1;
Q.push(nex);
}
nex.n[0]=fir.n[0],nex.n[1]=fir.n[1],nex.n[2]=fir.n[3],nex.n[3]=fir.n[2];
if(!judge())
{
nex.step=fir.step+1;
map[nex.n[0]][nex.n[1]][nex.n[2]][nex.n[3]]=1;
Q.push(nex);
}
}
int bfs()
{
while(!Q.empty())
Q.pop();
for(int i=0;i<4;i++)
{
fir.n[i]=finf[i];
}
fir.step=0;
Q.push(fir);
while(!Q.empty())
{
fir=Q.front();
Q.pop();
if(fir.n[0]==finn[0]&&fir.n[1]==finn[1]&&fir.n[2]==finn[2]&&fir.n[3]==finn[3])
{
return fir.step;
}
build();
}
}
int main()
{
char c1[10],c2[10];
int T;
scanf("%d",&T);
while(T--)
{
scanf("%s%s",c1,c2);
for(int i=0;i<4;i++)
{
finf[i]=c1[i]-'0';
finn[i]=c2[i]-'0';
}
memset(map,0,sizeof(map));
printf("%d\n",bfs());
}
return 0;
}