HDU1242（优先队列，最短路）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
  
  

 

求最短路时，用到BFS

#include <iostream>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <queue>
#include <vector>
#define maxn 210
#define INF 100000000
using namespace std;
typedef pair<int, int> P;
char ma[maxn][maxn];
int bf[maxn][maxn];
int si, sj, ei, ej;
int di[4][2] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
int n, m;


//最短路径
//有没有路径的情况
//输出最短路径

//百度提示用优先队列


int bfs()
{
    queue<P> que;
    for(int i = 1; i <= n; i++)
            for(int j = 1; j <= m; j++)
                bf[i][j] = INF;
    que.push(P(si, sj));
     bf[si][sj] = 0;
     while(que.size())
     {
         P p = que.front();
         que.pop();
         if(p.first == ei && p.second == ej)
            break;
         for(int i = 0; i < 4; i++)
         {
             int x = p.first + di[i][0];
             int y = p.second + di[i][1];
             //inf有无访问过
             if(bf[x][y] == INF && x >= 1 && x <= n && y >= 1 && y <= m && ma[x][y] != '#')
             {
                 que.push(P(x, y));
                 if(ma[x][y] == 'x')
                 {
                     bf[x][y] =  bf[p.first][p.second] + 2;
                 }
                 else
                 {
                     bf[x][y] =  bf[p.first][p.second] + 1;
                 }

             }
         }
     }
     return bf[ei][ej];
}
int main()
{
    //freopen("in.txt", "r", stdin);
    while(~scanf("%d %d", &n, &m))
    {
        getchar();
        for(int i = 1; i <= n; i++)
        {
            for(int j = 1; j <= m; j++)
            {
                scanf("%c", &ma[i][j]);
                if(ma[i][j] == 'r')
                {
                    si = i;;
                    sj = j;
                }
                else if(ma[i][j] == 'a')
                {
                    ei = i;
                    ej = j;
                }
            }
            getchar();
        }
        int ans = bfs();
        if(ans == INF)
        {
            printf("Poor ANGEL has to stay in the prison all his life.\n");

        }
        else
        {
            printf("%d\n", ans);
        }
    }
    return 0;
}

尴尬，果然过段时间不看，搜索又忘了....