Rescue
Angel was caught by the MOLIGPY! He was put in prison by Moligpy. The prison is described as a N * M (N, M <= 200) matrix. There are WALLs, ROADs, and GUARDs in the prison.
Angel’s friends want to save Angel. Their task is: approach Angel. We assume that “approach Angel” is to get to the position where Angel stays. When there’s a guard in the grid, we must kill him (or her?) to move into the grid. We assume that we moving up, down, right, left takes us 1 unit time, and killing a guard takes 1 unit time, too. And we are strong enough to kill all the guards.
You have to calculate the minimal time to approach Angel. (We can move only UP, DOWN, LEFT and RIGHT, to the neighbor grid within bound, of course.)
Input
First line contains two integers stand for N and M.
Then N lines follows, every line has M characters. “.” stands for road, “a” stands for Angel, and “r” stands for each of Angel’s friend.
Process to the end of the file.
Output
For each test case, your program should output a single integer, standing for the minimal time needed. If such a number does no exist, you should output a line containing “Poor ANGEL has to stay in the prison all his life.”
Sample Input
7 8
#.#####.
#.a#…r.
#…#x…
…#…#.#
#…##…
.#…
…
Sample Output
13
注意:只有一个a而有多个r,所以可以从a开始遍历,直到找到最近的r,注意使用优先队列优先遍历不是守卫的四周,这样如果有两个守卫挨着也能找到每一步的最小值
#include<iostream>
#include<algorithm>
#include<queue>
#include<cstring>
using namespace std;
const int MAXN=210;
vector<int> G[MAXN];
char s[MAXN][MAXN];
int vis[MAXN][MAXN];
int n,m;
struct node{
int x,y;
int step;
friend bool operator<(node a,node b){
return a.step>b.step ;
}
};
int d[4][2]={1,0,-1,0,0,1,0,-1};
int ans;
void bfs(int x1,int y1){
memset(vis,0,sizeof(vis));
priority_queue<node> que;
node e1,e2;
e1.x=x1;
e1.y=y1;
e1.step =0;
que.push(e1);
vis[x1][y1]=1;
while(!que.empty()){
e1=que.top();
//cout<<"*******"<<e1.step<<" "<<e1.x <<" "<<e1.y <<endl;
que.pop();
if(s[e1.x ][e1.y ]=='r'){
ans=min(e1.step ,ans);
// cout<<"....."<<ans<<" "<<e1.step<<endl;
break;
}
for(int i=0;i<4;i++){
e2.x =e1.x +d[i][0];
e2.y =e1.y +d[i][1];
if(e2.x >=0&&e2.x <n&&e2.y >=0&&e2.y <m&&!vis[e2.x ][e2.y ]&&s[e2.x ][e2.y ]!='#'){
if(s[e2.x ][e2.y ]=='.'||s[e2.x ][e2.y ]=='r'||s[e2.x ][e2.y ]=='a'){
e2.step =e1.step +1;
// cout<<"step.:"<<e1.step<<endl;
}
else if(s[e2.x ][e2.y ]=='x'){
e2.step =e1.step +2;
// cout<<"stepx:"<<e1.step<<endl;
// cout<<"####"<<endl;
}
// cout<<"step:"<<e2.step<<endl;
que.push(e2);
// cout<<e2.x <<" "<<e2.y <<endl;
vis[e2.x ][e2.y ]=1;
}
}
}
}
int main(){
int dx,dy,xx,yy;
while(cin>>n>>m&&n&&m){
ans=0x3f3f3f3f;
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
cin>>s[i][j];
if(s[i][j]=='a'){
xx=i;
yy=j;
}
if(s[i][j]=='r'){
dx=i;
dy=j;
}
}
}//cout<<dx<<" "<<dy<<" "<<xx<<" "<<yy<<endl;
bfs(xx,yy);
if(ans==0x3f3f3f3f) cout<<"Poor ANGEL has to stay in the prison all his life."<<endl;
else cout<<ans<<endl;
}
return 0;
}
/*
7 8
#.#####.
#a.#..r.
#xx#x...
.....###
#....#..
.#......
........
*/