HDU 1242 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." 

Simple Input:

7 8

#.#####.

#.a#..r.

#..#x...

..#..#.#

#...##..

.#......

........

Simple Output:

13

题目分析：本题仍然属于搜索的走迷宫问题，要求从r处走到a处的最快路径，遇到x则要停留2秒，其余只要1秒，因此用bfs+优先队列算法即可。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<queue>//优先队列头文件
using namespace std;
int n,m;
int sx,sy;
char map[201][201];
int vis[201][201];
int dir[4][2]={{0,-1},{0,1},{1,0},{-1,0}};//4个方向
struct Node
{
    int x,y,time;
    friend bool operator<(Node a,Node b)//优先队列
    {
        return a.time>b.time;
    }
};
int bfs()
{
    Node now,next;
    int i;
    priority_queue<Node>q;//时间少的优先级高
    while(!q.empty())//清空队列元素
    {
        q.pop();
    }
    now.x=sx;
    now.y=sy;
    now.time=0;
    q.push(now);//将当前点入队
    vis[now.x][now.y]=1;//进队即访问过
    while(!q.empty())
    {
        now=q.top();
        q.pop();
        if(map[now.x][now.y]=='a')//找到终点，返回
            return now.time;
        for(i=0;i<4;i++)
        {
            next.x=now.x+dir[i][0];
            next.y=now.y+dir[i][1];
            if(next.x>=0&&next.x<n&&next.y>=0&&next.y<m&&map[next.x][next.y]!='#'&&!vis[next.x][next.y])
            {
                if(map[next.x][next.y]=='x')
                {
                    next.time=now.time+2;
                }
                else
                    next.time=now.time+1;
                vis[next.x][next.y]=1;
                q.push(next);//将该点入队
            }
        }

    }return -1;
}
int main()
{
    while(scanf("%d%d",&n,&m)!=EOF)
    {
        int i,j;
        getchar();
        memset(vis,0,sizeof(vis));
        for(i=0;i<n;i++)
        {
            scanf("%s",&map[i]);
            for(j=0;j<m;j++)
            {
                if(map[i][j]=='r')
                {
                    sx=i;
                    sy=j;
                }
            }
        }
        int ans=bfs();
        if(ans!=-1)
        {
            printf("%d\n",ans);
        }
        else
        {
            printf("Poor ANGEL has to stay in the prison all his life.\n");
        }
    }
    return 0;
}