学步园

#include "iostream"<br /> #include "queue"<br /> #define M 1000000<br /> using namespace std;</p> <p>typedef struct{</p> <p> int x;<br /> int y;<br /> int step;<br /> }Position;</p> <p>Position temp,t,start[201],end;<br /> int delta[4][2]={{-1,0},{0,1},{1,0},{0,-1}};<br /> char map[201][201];<br /> int col,row,Min;<br /> bool visit[201][201],visit_f[201][201];</p> <p>void Bfs()<br /> {</p> <p> queue<Position> q;<br /> visit[end.x][end.y]=true;<br /> end.step=0;<br /> q.push(end);<br /> while(!q.empty())<br /> {</p> <p> temp=q.front();<br /> q.pop();<br /> // cout<<temp.x<<" "<<temp.y<<" "<<temp.step<<endl;<br /> if(visit_f[temp.x][temp.y]==true)<br /> {<br /> if(temp.step<Min)<br /> Min=temp.step;<br /> }<br /> if(map[temp.x][temp.y]=='x')<br /> {<br /> temp.step++;<br /> map[temp.x][temp.y]='.';<br /> if(Min>temp.step)<br /> q.push(temp);<br /> //printf("/n");<br /> }<br /> else<br /> { </p> <p> for(int i=0;i<4;i++)<br /> {</p> <p> t.x=delta[i][0]+temp.x;<br /> t.y=delta[i][1]+temp.y;<br /> if(!visit[t.x][t.y]&&(map[t.x][t.y]!='#')&&t.x>0&&t.x<=col&&t.y>0&&t.y<=row)<br /> {</p> <p> t.step=temp.step+1;<br /> visit[t.x][t.y]=true;<br /> if(Min>t.step)<br /> q.push(t);<br /> } </p> <p> }</p> <p> }<br /> }<br /> } </p> <p>int main()<br /> {<br /> freopen("data.in","r",stdin);<br /> while(scanf("%d%d",&col,&row)!=EOF)<br /> {<br /> Min=M;<br /> memset(visit,false,sizeof(visit));<br /> memset(visit_f,false,sizeof(visit_f));<br /> for(int i=1;i<=col;i++)<br /> {<br /> for(int j=1;j<=row;j++)<br /> {<br /> cin>>map[i][j];<br /> if(map[i][j]=='r')<br /> visit_f[i][j]=true;<br /> if(map[i][j]=='a')<br /> {<br /> end.x=i;<br /> end.y=j;<br /> }<br /> }<br /> }</p> <p> Bfs();<br /> if(Min!=M)<br /> cout<<Min<<endl;<br /> else<br /> cout<<"Poor ANGEL has to stay in the prison all his life."<<endl;<br /> }<br /> while(1);<br /> return 0;<br /> } </p> <p>