BFS走迷宫.docx

1、B - BTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d struct nodeint x,y;int t;bool vis110110;char Map110110;int n,m;int x1,y1,x2,y2,kk;int dir42=1,0,-1,0,0,1,0,-1;bool jud(int x,int y)if(x=n|y=m)return false;if(Mapxy=*)return false;return true;bool bfs()queue q;node a,k;a.x=x1,a.y=y1,a.

2、t=-1;visx1y1=1;q.push(a);while(!q.empty()a=q.front();q.pop();if(a.t=kk) continue;for(int i=0;i4;i+)k.x=a.x+diri0;k.y=a.y+diri1;k.t=a.t+1;while(1)if(!jud(k.x,k.y) break;if(k.x=x2 if(!visk.xk.y)q.push(k);visk.xk.y=1;k.x+=diri0;k.y+=diri1;return false;int main()int t;scanf(“%d“,for(int j=0;jt;j+)scanf(“%d%d“,gets(Map0);for(int i=0;in;i+)gets(Mapi);scanf(“%d%d%d%d%d“,x1-,y1-,x2-,y2-;memset(vis,0,sizeof(vis);printf(“%sn“,bfs()?“yes“:“no“);return 0;