1242 rescue 广搜

#include <stdio.h>#define N 201#define MAX 0x7ffffffchar map[N][N];bool vis[N][N];int n,m;int Min;int base=0,top=0;int mo[4][2]={{-1,0},{0,1},{1,0},{0,-1}};struct Queue{ int i,j,delay,count;}qu[N*N];//杭电数据不给力 开个N也能过。。。void push(int i,int j,int count,int delay){qu[top].i=i;qu[top].j=j;qu[top].count=count;qu[top].delay=delay;top++;}void bfs(int sti,int stj){ int in,jn,k,i,j;top=base=0; push(sti,stj,0,0); vis[sti][stj]=1; while(base!=top) { if (qu[base].delay)//把'x'放到队尾 {push(qu[base].i,qu[base].j,qu[base].count+1,0); base++; continue;//必须加 可能碰到多个x连续 } i=qu[base].i; j=qu[base].j; for (k=0;k<4;k++) { in=i+mo[k][0]; jn=j+mo[k][1]; if (in>=0 && in<n && jn>=0 && jn<m && vis[in][jn]==0 && map[in][jn]!='#') { vis[in][jn]=1;push(in,jn,qu[base].count+1,0); if (map[in][jn]=='x') qu[top-1].delay=1; else if (map[in][jn]=='r') { Min=qu[top-1].count; return; } } } base++; }}int main (){//freopen("1.txt","r",stdin); int i,j,sti,stj; while(scanf("%d%d%*c",&n,&m)!=EOF) { for (i=0;i<n;i++) { for (j=0;j<m;j++) { scanf("%c",&map[i][j]); vis[i][j]=0; if (map[i][j]=='a') sti=i,stj=j;//从终点开始搜 搜到的r肯定就是最短的 }getchar(); } Min=MAX; bfs(sti,stj); if (Min!=MAX) printf("%d/n",Min); else printf("Poor ANGEL has to stay in the prison all his life./n"); }}