HDU 1242 BFS-Rescue

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.”

题意：

---

从r出发，只能走前后左右四个方向，每次走一步，每走一步消耗一个单位的时间，如果遇到墙不能走，如果经过狱警花费两个单位的时间，求到a点的最小时间。

---

题解：

---

深度优先搜索问题，不过本题由于狱警处花费的时间和普通的道路上花费的时间不一样，所以用最小值优先的优先队列保存花费长度，这样子第一次搜索到a的时候就是最小时间。

---

#include <iostream>
#include <queue>
#include <vector>
#include <functional>
#include <string.h>
#include <stdio.h>
#define MAXN 200 + 10
using namespace std;

const int dx[] = {-1,0,1,0};
const int dy[] = {0,-1,0,1};

int m,n,min_num;
char grid[MAXN][MAXN];
int flag[40010];
struct cmp1{
    bool operator ()(int &a,int &b){
        return flag[a]>flag[b];//最小值优先
    }
};
priority_queue<int,vector<int>,cmp1>q;

void bfs(int i, int j)
{
    while(!q.empty())q.pop();
    q.push(i*m+j);
    while(!q.empty())
    {
        int u = q.top();
        q.pop();
        int cx = u / m;
        int cy = u % m;
        for(int k = 0; k < 4; k++)
        {
            int nx = cx + dx[k];
            int ny = cy + dy[k];
            if(nx >= 0 && nx < n && ny >= 0 && ny < m)
            {
                if(flag[nx*m+ny] == 0)
                {
                    if(grid[nx][ny] == '.')
                    {
                        flag[nx*m+ny] = flag[cx*m+cy] + 1;
                        q.push(nx*m+ny);
                    }
                    if(grid[nx][ny]== 'x')
                    {
                        flag[nx*m+ny] = flag[cx*m+cy] + 2;
                        q.push(nx*m+ny);
                    }
                    if(grid[nx][ny] == 'a')
                    {
                        if(flag[cx*m+cy]+1 < min_num)
                            min_num = flag[cx*m+cy]+1;
                        return;
                    }
                }
            }
        }
    }
}

int main()
{
    while(cin >> n >> m)
    {
        min_num = 100000;
        for(int i = 0; i < n; i++)
            for(int j = 0; j < m; j++)
                cin >> grid[i][j];
        for(int i = 0; i < n; i++)
        {
            for(int j = 0; j < m; j++)
            {
                if(grid[i][j] == 'r')
                {
                    //cout << i << j << endl;
                    memset(flag, 0, sizeof(flag));
                    bfs(i,j);
                }
            }
        }
        if(min_num == 100000)
            cout << "Poor ANGEL has to stay in the prison all his life." << endl;
        else
            cout << min_num << endl;
    }
    return 0;
}