#include <bits/stdc++.h>
using namespace std;
int n,m,sx,sy,ex,ey,dis[505][505],dx[] = {-2,-1,1,2},dy[] = {1,2,2,1};
char a[505][505];
void bfs(){
queue<int> qx,qy;
qx.push(sx),qy.push(sy);
dis[sx][sy] = 0;
while (!qx.empty()){
int x = qx.front(),y = qy.front();
qx.pop(),qy.pop();
for (int i = 0;i < 4;i++){
int nx = x + dx[i],ny = y + dy[i];
if (nx >= 1 && nx <= n && ny >= 1 && ny <= n && dis[nx][ny] == -1){
dis[nx][ny] = dis[x][y] + 1;
if (nx == ex && ny == ey) return;
qx.push(nx),qy.push(ny);
}
}
}
}
int main(){
cin >> n;
memset(dis,-1,sizeof(dis));
cin >> sx >> sy >> ex >> ey;
bfs();
cout << dis[ex][ey];
return 0;
}
稻花香里说丰年，听取WA声一片。
