Rescue



Problem Description

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
  
  
  
  


  
  
  
  


  
  
  
  

   
   宽度优先算法。
  
  
  
  

   
   
1.天使可能有多个朋友，所以不能从朋友的位置开始着天使，只能是从天使找离他最近的朋友
   
   
2.题目要求的是找到一个用时最少的朋友，而不是步数最少
   
   

   
   
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include <queue>
#define N 201
using namespace std;
//优先队列解决,广度优先
struct node
{
    int x,y;
    int time;
    friend bool operator < (const node &a,const node &b)
    {
        return a.time>b.time; //">" 返回队列中较小的元素；"< " 则返回队列中较大的元素
    }
};
int dir[4][2]={{-1,0},{1,0},{0,-1},{0,1}};
char map[N][N];
int visited[N][N];
int m,n;
int BFS(int x,int y)
{
    priority_queue <node>q;
    node current,next;
    memset(visited,0,sizeof(visited));
    current.x=x;
    current.y=y;
    current.time=0;
    visited[current.x][current.y]=1;
    q.push(current);
    while(!q.empty())
    {
        current=q.top();
        q.pop();
        for(int i=0;i<4;i++)
        {
            next.x=current.x+dir[i][0];
            next.y=current.y+dir[i][1];
            if(next.x>=0&&next.x<n&&next.y>=0&&next.y<m&&map[next.x][next.y]!='#'&&!visited[next.x][next.y])
            {
                if(map[next.x][next.y]=='r')
                    return current.time+1;
                if(map[next.x][next.y]=='x')
                    next.time=current.time+2;
                else
                    next.time=current.time+1;
                visited[next.x][next.y]=1;
                q.push(next);
            }
        }
    }
    return -1;
}
int main()
{
    int i,j;
    node angle;
    while(cin>>n>>m&&(m||n))
    {
        for(i=0;i<n;i++)
            for(j=0;j<m;j++)
            {
                cin>>map[i][j];
                if(map[i][j]=='a')
                {
                    angle.x=i;
                    angle.y=j;
                }
            }
         int time=BFS(angle.x,angle.y);
         if(time==-1)
            cout<<"Poor ANGEL has to stay in the prison all his life."<<endl;
         else
            cout<<time<<endl;
    }
    return 0;
}