#include<iostream>
#include<cstdio>
#include<queue>
#define M 6
#define N 6
using namespace std;
int BFS(int sx, int sy, int gx, int gy);
int map[M][N] = {
1, 1, 1, 1, 1, 1,
1, 0, 0, 1, 0, 1,
1, 0, 0, 1, 0, 1,
1, 1, 0, 0, 0, 1,
1, 0, 0, 0, 1, 1,
1, 1, 1, 1, 1, 1
};
int dir[M][N];
int c[4][2] = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};
int sx, sy, gx, gy;
struct A{
int x;
int y;
int b;
};
int main(){
scanf("%d%d%d%d", &sx, &sy, &gx, &gy);
BFS(sx, sy, gx, gy);
return 0;
}
int BFS(int sx, int sy, int gx, int gy){
int i, j;
int flag = 0;
A tmp, t;
t.x = sx;
t.y = sy;
t.b = 0;
queue<struct A> q;
q.push(t);
while(!q.empty()){
t = q.front();
q.pop();
dir[t.x][t.y] = t.b + 1;
if(t.x == gx && t.y == gy){
flag = 1;
break;
}
for(i = 0; i < 4; i++){
tmp.x = t.x + c[i][0];
tmp.y = t.y + c[i][1];
tmp.b = t.b + 1;
if(!dir[tmp.x][tmp.y] && map[tmp.x][tmp.y] != 1 && t.x < 6 && t.x > 0 && t.y < 6 && t.y > 0){
q.push(tmp);
dir[tmp.x][tmp.y] = tmp.b + 1;
}
}
}
if(flag == 1){
printf("%d\n", dir[t.x][t.y]);
}
}
输入
1 1 4 3
输出
6