nyoj54 最少步数 搜索BFS 入门题

#include<stdio.h>
#include<iostream>
#include<queue>
#include<cstring>
using namespace std;
int a[9][9]=
{
    1,1,1,1,1,1,1,1,1,  
    1,0,0,1,0,0,1,0,1,  
    1,0,0,1,1,0,0,0,1,  
    1,0,1,0,1,1,0,1,1,  
    1,0,0,0,0,1,0,0,1,  
    1,1,0,1,0,1,0,0,1,  
    1,1,0,1,0,1,0,0,1,  
    1,1,0,1,0,0,0,0,1,  
    1,1,1,1,1,1,1,1,1
};


int b[4]={-1,1,0,0};
int c[4]={0,0,-1,1};
int visit[9][9];


struct node
{
int x,y;
int step;
};




int bfs(int x1,int y1,int x2,int y2)
{
int i,s,t;
node e={x1,y1,0};//新建结构体并赋初值 
queue<node>Q;
Q.push(e);
visit[x1][y1]=1;
while(!Q.empty())
{
e=Q.front();
if(e.x==x2&&e.y==y2)
break;
Q.pop();
for(i=0;i<4;i++)
{
s=e.x+b[i];
t=e.y+c[i];
if(s>=0&&s<=8&&t>=0&&t<=8&&!visit[s][t]&&a[s][t]==0)
{
node e1={s,t,e.step+1};
Q.push(e1);
visit[s][t]=1;
}
}
}
if(Q.empty())//进入了死胡同，说明无法到达 
return -1;
while(!Q.empty())//如果队列不为空 
Q.pop();//清空队列，以便再次使用 
return e.step;
}




int main()
{
int k,s,x1,x2,y1,y2;
scanf("%d",&s);
while(s--)
{
scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
memset(visit,0,sizeof(visit));
k=bfs(x1,y1,x2,y2);
printf("%d\n",k);
}
return 0;
}