题意:
如文中图所示,在国际象棋中骑士有这八种移动方式,给出起点和终点,求从起点到终点的最小步数
思路:
bfs,只要到了终点就输出终点步数,根据bfs特性,此时即为最小值
代码:
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <queue>
using namespace std;
const int MAXN = 300 + 5;
int n;
bool vis[MAXN][MAXN];
int dx[] = {-2,-2,-1,-1,2,2,1,1};
int dy[] = {-1,1,-2,2,-1,1,-2,2};
struct node{
int x;
int y;
int step;
}S,T;
void init(int n){
for(int i=0; i<n; i++)
for(int j=0; j<n; j++)
vis[i][j] = false;
vis[S.x][S.y] = true;
}
int BFS(){
queue <node> Q;
Q.push(S);
while(!Q.empty()){
node Now = Q.front();
node New;
Q.pop();
for(int i=0; i<8; i++){
New.x = Now.x + dx[i];
New.y = Now.y + dy[i];
if(New.x<0 || New.x>=n || New.y<0 || New.y>=n || vis[New.x][New.y]) continue;
New.step = Now.step + 1;
Q.push(New);
vis[New.x][New.y] = true;
if(New.x==T.x && New.y==T.y) return New.step;
}
}
return 0;
}
int main(){
int t;
scanf("%d", &t);
while(t--){
scanf("%d", &n);
scanf("%d%d%d%d", &S.x, &S.y, &T.x, &T.y);
init(n);
if(S.x==T.x && S.y==T.y) {printf("0\n"); continue;}
printf("%d\n", BFS());
}
return 0;
}
反思:
做题一定要谨慎一些!
wa了两次,无语,输入和初始化颠倒了,起点的坐标还不知道就初始化了……