hdu1242（BFS）

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

题目大意：在迷宫里面，‘a’去找‘r’，’r‘可能不止一个，路障为’#’ ‘.’表示可以走，守卫为‘x’（但是题目中居然没说明）
消灭x路程+1，求a找到r的最短luj
思路：用普通的bfs，要注意的点是，当面对访问过的点时，需要判断到达这个点距离step是否是最小的，不是的话把短的路径给这个点，并且继续入队，这样就保证了vis[][]里面的都是最短路径
输入格式要注意一下，还有初始化
代码：

#include <bits/stdc++.h>

using namespace std;
const int maxn=205;
const int INF=999999;
int n,m,ans;
int ax,ay,rx,ry;
char z[maxn][maxn];
int vis[maxn][maxn];
int dir[4][2]={1,0,0,1,-1,0,0,-1};
typedef struct node
{
    int x,y,step;

}node;
void bfs()
{
    queue<node> Q;
    node nd;
    nd.x=ax;nd.y=ay;nd.step=0;
    Q.push(nd);
    while(!Q.empty())
    {
        nd=Q.front();
        Q.pop();
        if(z[nd.x][nd.y]=='r')
        {
            ans=min(ans,nd.step);
            continue;
        }
        for(int i=0;i<4;i++)
        {
            int xx=nd.x + dir[i][0];
            int yy=nd.y + dir[i][1];
            if(xx>=0 && xx<n && yy>=0 && yy<m && z[xx][yy]!='#')
            {
                int s=nd.step+1;
                if(z[xx][yy]=='x')
                    s++;
                if(vis[xx][yy]>s)
                {

                    vis[xx][yy]=s;
                    node now;
                    now.x=xx,now.y=yy,now.step=s;
                    Q.push(now);
                }

            }
        }
    }
}
int main()
{
    while(scanf("%d %d",&n,&m)==2)
    {

        for(int i=0; i<n; i++)
            scanf("%s",z[i]);
        for(int i=0; i<n; i++)
        {
            for(int j=0; j<m; j++)
            {
                vis[i][j]=INF;
                if(z[i][j]=='a')
                {
                    ax=i;ay=j;
                }
            }

        }
        ans=INF;
        bfs();
        if(ans==INF)
            printf("Poor ANGEL has to stay in the prison all his life.\n");
        else
            printf("%d\n",ans);
    }

    return 0;
}
/*
4 4
####
#ar#
#..#
####

*/