1、明显用bfs,第一次裸敲bfs,还是有诸多问题。。。
#include<cstdio>
#include<queue>
#include<utility>
#include<cstring>
using namespace std;
struct node{
int x,y,dist;
node(int _x,int _y,int _dist):x(_x),y(_y),dist(_dist){}
};
queue<node> q;
int vis[110][110];
int R,C,GR,GC,LR,LC;
int dx[8]={1,2,2,1,-1,-2,-2,-1};
int dy[8]={2,1,-1,-2,-2,-1,1,2};
bool is_valid(int x,int y){
if(x>=1&&x<=R&&y>=1&&y<=C) return true;
return false;
}
void bfs(int x,int y){
if(x==LR&&y==LC){
printf("0\n");
return;
}
while(!q.empty()) q.pop();
q.push(node(x,y,0));
vis[x][y]=1;
while(!q.empty()){
node temp=q.front();
q.pop();
int tx=temp.x,ty=temp.y;
if(tx==LR&&ty==LC){
printf("%d\n",temp.dist);
return;
}
for(int i=0;i<8;i++){
int nx=dx[i]+tx,ny=dy[i]+ty;
if(is_valid(nx,ny)&&!vis[nx][ny]){
q.push(node(nx,ny,temp.dist+1));
vis[nx][ny]=1;
}
}
}
printf("impossible\n");
}
int main(){
while(scanf("%d%d%d%d%d%d",&R,&C,&GR,&GC,&LR,&LC)==6){
memset(vis,0,sizeof(vis));
bfs(GR,GC);
}
return 0;
}