简单最短路径问题
Theme
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<queue>
#include<cmath>
#include<vector>
using namespace std;
const int N=333;
int dis[N][N],l,sx,sy,ex,ey;
bool vis[N][N];
int dir[8][2]={{-1,2},{-2,1},{1,2},{2,1},{-1,-2},{-2,-1},{1,-2},{2,-1}};
bool check(int x,int y){
return x>=1&&x<=l&&y>=1&&y<=l;
}
void BFS(int sx,int sy){
queue<pair<int,int> > q;
q.push(make_pair(sx,sy));
dis[sx][sy]=0;
while(!q.empty()){
pair<int,int> now=q.front();
q.pop();
int nx=now.first;
int ny=now.second;
if(nx==ex&&ny==ey) break;
if(vis[nx][ny]) continue;
vis[nx][ny]=1;
for(int i=0;i<8;i++){
int dx=dir[i][0]+nx;
int dy=dir[i][1]+ny;
if(check(dx,dy)&&!vis[dx][dy]){
dis[dx][dy]=dis[nx][ny]+1;
q.push(make_pair(dx,dy));
}
}
}
}
void solve(){
scanf("%d",&l);
for(int i=1;i<=l;i++){
for(int j=1;j<=l;j++){
vis[i][j]=0;
dis[i][j]=0;
}
}
scanf("%d%d%d%d",&sx,&sy,&ex,&ey);
++sx;
++sy;
++ex;
++ey;
BFS(sx,sy);
printf("%d\n",dis[ex][ey]);
}
int main(){
int T;
scanf("%d",&T);
while(T--){
solve();
}
return 0;
}