标签：hduj   c++   

Rescue

7 8
#.#####.
#.a#..r.
#..#x...
..#..#.#
#...##..
.#......
........

13

#include<iostream>
#include<cstring>
#include<queue>
using namespace std;

#define M 205
char c[M][M];
int v[M][M];
int w[4][2]={1,0,0,-1,-1,0,0,1};
int ans,n,m;

struct node 
{
    int x,y,time;
};

void bfs(int a,int b)
{
    node now,tmp;
    queue<node>   q;
    now.time=0;
    now.x=a;
    now.y=b;
    memset(v,0,sizeof(v));
    v[a][b]=1;
    q.push(now);

    while(!q.empty())
    {
        now=q.front();
        q.pop();
        if(c[now.x][now.y]=='r')
        {
            ans=now.time;
            return ;
        }

        for(int i=0;i<4;i++)
        {
            tmp.x=now.x+w[i][0];
            tmp.y=now.y+w[i][1];
            if(tmp.x>=0&&tmp.x<n&&tmp.y>=0&&tmp.y<m
                &&!v[tmp.x][tmp.y]&&c[tmp.x][tmp.y]!='#')
            {
                v[tmp.x][tmp.y]=1;
                if(c[tmp.x][tmp.y]=='r'||c[tmp.x][tmp.y]=='.')
                    tmp.time=now.time+1;
                if(c[tmp.x][tmp.y]=='x')
                    tmp.time=now.time+2;
                q.push(tmp);
            }
        }
    }
    return;
}

int main()
{
    while(cin>>n>>m)
    {
        int i,j,x,y;
        for(i=0;i<n;i++)
            for(j=0;j<m;j++)
            {
                cin>>c[i][j];
                if(c[i][j]=='a')
                    x=i,y=j;
            }

        ans=0;
        bfs(x,y);
        if(ans)
            cout<<ans<<endl;
        else
            cout<<"Poor ANGEL has to stay in the prison all his life.\n";
    }

    return 0;
}

HDUJ 1242 Rescue 搜索,布布扣,bubuko.com

HDUJ 1242 Rescue 搜索

标签：hduj   c++   

原文地址：http://blog.csdn.net/hyccfy/article/details/38145849