ZOJ - 1649 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

 

 

 

题目大意：

寻找从r到a的最短时间的通路，其中通过点x需要2s

题目分析：

最优解用bfs，具体求解思路详见代码注释：

AC代码：

 

#include<iostream>
#include<cstring>
#include<cstdlib>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<queue>
using namespace std;
const int maxn=205;
const int INF=0xfffffff;
char map[maxn][maxn];
int mintime[maxn][maxn];//记录到达(x,y)的最短时间
int sx,sy,ex,ey;
int dx[]={0,0,-1,1};
int dy[]={1,-1,0,0};
struct p
{
    int x,y;
    int time;//到达(x,y)所需要的时间
};
int n,m;
queue<p> Q;
int bfs(p s)
{
    Q.push(s);
    p push_p;//记录队首元素
    while(!Q.empty())
    {
        push_p=Q.front();
        Q.pop();
        for(int i=0;i<4;i++)
        {
            int x=push_p.x+dx[i],y=push_p.y+dy[i];
            if(x>=0&&x<n&&y>=0&&y<m&&map[x][y]!='#')
            {
                p now;//向该方向移动了一步到达的位置
                now.x=x;
                now.y=y;
                now.time=push_p.time+1;
                if(map[x][y]=='x')
                    now.time++;
                if(now.time<mintime[x][y])
                {
                    mintime[x][y]=now.time;
                    Q.push(now);
                }
            }
        }
    }
    return mintime[ex][ey];
}
int main()
{
    while(~scanf("%d%d",&n,&m))
    {
        for(int i=0;i<n;i++)
        {
            scanf("%s",map[i]);
            for(int j=0;j<m;j++)
            {
                if(map[i][j]=='r')
                {
                    sx=i;
                    sy=j;
                }
                else if(map[i][j]=='a')
                {
                    ex=i;
                    ey=j;
                }
                mintime[i][j]=INF;
            }
        }
        p start;
        start.x=sx;
        start.y=sy;
        start.time=0;
        mintime[sx][sy]=0;
        int t=bfs(start);
        if(t<INF)
            cout<<t<<endl;
        else
            cout<<"Poor ANGEL has to stay in the prison all his life."<<endl;
    }
    return 0;
}