普通bfs
题意:给两个四位数(1~9),求之间变换的最小步数
1.每位数字可+1,10->1
2.每位数字可-1,0->9
3.相邻两位数字可交换,首尾不算相邻
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <queue>
using namespace std;
int t;
char s1[5],s2[5];
struct node {
int num[4],s;
}f,e;
bool book[15][15][15][15];
void bfs() {
node a,b;
f.s=0;
a=f;
book[a.num[0]][a.num[1]][a.num[2]][a.num[3]]=true;
queue<node> q;
q.push(a);
while (!q.empty()) {
a=q.front();
q.pop();
if (a.num[0]==e.num[0] && a.num[1]==e.num[1] && a.num[2]==e.num[2] && a.num[3]==e.num[3]) {
printf ("%d\n",a.s);
return;
}
for (int i=0;i<4;i++) { //+1
b=a;
b.num[i]++;
if (b.num[i]==10) b.num[i]=1;
if (book[b.num[0]][b.num[1]][b.num[2]][b.num[3]]==false) {
book[b.num[0]][b.num[1]][b.num[2]][b.num[3]]=true;
b.s++;
q.push(b);
}
}
for (int i=0;i<4;i++) { //-1
b=a;
b.num[i]--;
if (b.num[i]==0) b.num[i]=9;
if (book[b.num[0]][b.num[1]][b.num[2]][b.num[3]]==false) {
book[b.num[0]][b.num[1]][b.num[2]][b.num[3]]=true;
b.s++;
q.push(b);
}
}
for (int i=0;i<3;i++) { //交换
b=a;
b.num[i]=a.num[i+1];
b.num[i+1]=a.num[i];
if (book[b.num[0]][b.num[1]][b.num[2]][b.num[3]]==false) {
book[b.num[0]][b.num[1]][b.num[2]][b.num[3]]=true;
b.s++;
q.push(b);
}
}
}
}
int main()
{
scanf ("%d",&t);
while (t--) {
scanf ("%s%s",s1,s2);
for (int i=0;i<4;i++) {
f.num[i]=s1[i]-'0';
e.num[i]=s2[i]-'0';
}
memset(book,false,sizeof(book));
bfs();
}
return 0;
}