ZOJ 1649 Rescue

最新推荐文章于 2019-09-25 17:25:58 发布

原创最新推荐文章于 2019-09-25 17:25:58 发布 · 431 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

搜索同时被 2 个专栏收录

31 篇文章

订阅专栏

POJ

30 篇文章

订阅专栏

本文介绍了一个算法竞赛题目，目标是在一个包含墙壁、道路和守卫的监狱地图中找到从朋友位置到被囚禁的天使位置的最短路径。文章提供了完整的C++代码实现，并采用广度优先搜索算法解决该问题。

Rescue

Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%lld & %llu

Submit Status

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

#include<iostream>
#include<stdio.h>
#include<cmath>
#include<string>
#include<string.h>
#include<queue>
#include<algorithm>

using namespace std;

const int maxn=250;
char point[maxn][maxn];
int sign[maxn][maxn];
int n,m,i,j,k,sum,sx,sy,ex,ey;
int dir[4][2]={{1,0},{-1,0},{0,-1},{0,1}};

struct node
{
    int x;
    int y;
    int sum;
}pos;

bool cheak(int x,int y)
{
    if(x<0||y<0||x>=n||y>=m||point[x][y]=='#')
        return false;
    return true;
}
void bfs()
{
    pos.x=sx,pos.y=sy,pos.sum=0;
    queue<node>q;
    sign[sx][sy]=0;
    q.push(pos);
    while(!q.empty())
    {
        node now=q.front();q.pop();
        for(i=0;i<4;i++)
        {
            node next=now;
            next.x+=dir[i][0],next.y+=dir[i][1];
            if(cheak(next.x,next.y))
            {
                next.sum+=1;
                if(point[next.x][next.y]=='x')next.sum++;
                if(sign[next.x][next.y]>next.sum){        //起到等同优先队列的作用
                    q.push(next);
                    sign[next.x][next.y]=next.sum;
                }
            }
        }
    }
}

int main()
{
    while(cin>>n>>m)
    {

        for(i=0;i<n;i++)
            for(j=0;j<m;j++)
        {
            cin>>point[i][j];
            sign[i][j]=1000000;
            if(point[i][j]=='a')
            {
                sx=i,sy=j;
            }
            if(point[i][j]=='r')
            {
                ex=i;
                ey=j;
            }
        }
        bfs();
        if(sign[ex][ey]==1000000)cout<<"Poor ANGEL has to stay in the prison all his life."<<endl;
        else cout<<sign[ex][ey]<<endl;
    }
    return 0;

}

优先队列：