题解:
模板题,BFS解决
步骤:
起点->入队->向8个方向扩展->满足条件的扩展点加入队列->重复以上,直到遇到终点或者队伍为空
需要注意的点是偏位移坐标不要写错了。
代码:
#include<iostream>
#include<algorithm>
#include<cstring>
#include<queue>
using namespace std;
int sx, sy, ex, ey, tx, ty, L;
const int Maxn = 310;
bool vis[Maxn][Maxn] = {false};
int dx[8] = {-2, -2, -1, -1, 1, 1, 2, 2};
int dy[8]={1, -1, 2, -2, 2, -2, 1, -1};
struct point{
int x;
int y;
int step;
};
int BFS() {
if(sx == ex && sy == ey) return 0;
memset(vis, false ,sizeof(vis));
point start, node;
queue<point> Q;
start.x = sx;
start.y = sy;
start.step = 0;
Q.push(start);
vis[sx][sy] = true;
int x, y, step = 0;
while(!Q.empty()) {
start = Q.front(), Q.pop();
x = start.x;
y = start.y;
step = start.step;
for(int i = 0; i < 8; i++) {
tx = x + dx[i];
ty = y + dy[i];
if(tx == ex && ty == ey) return step + 1;
if(tx >= 0 && ty >= 0 && tx < L && ty < L && !vis[tx][ty]) {
node.x = tx;
node.y = ty;
node.step = step + 1;
Q.push(node);
vis[tx][ty] = true;
}
}
}
}
int main() {
int n;
cin >> n;
for(int i = 0; i < n; i++) {
cin >> L;
cin >> sx >> sy;
cin >> ex >> ey;
cout << BFS() << "\n";
}
return 0;
}