HDU 1062(优先队列+BFS)-蒲公英云

问题描述:

The Princess has been abducted by the BEelzebub feng5166, our hero Ignatius has to rescue our pretty Princess. Now he gets into feng5166’s castle. The castle is a large labyrinth. To make the problem simply, we assume the labyrinth is a N*M two-dimensional array which left-top corner is (0,0) and right-bottom corner is (N-1,M-1). Ignatius enters at (0,0), and the door to feng5166’s room is at (N-1,M-1), that is our target. There are some monsters in the castle, if Ignatius meet them, he has to kill them. Here is some rules:

1.Ignatius can only move in four directions(up, down, left, right), one step per second. A step is defined as follow: if current position is (x,y), after a step, Ignatius can only stand on (x-1,y), (x+1,y), (x,y-1) or (x,y+1).
2.The array is marked with some characters and numbers. We define them like this:
. : The place where Ignatius can walk on.
X : The place is a trap, Ignatius should not walk on it.
n : Here is a monster with n HP(1<=n<=9), if Ignatius walk on it, it takes him n seconds to kill the monster.

Your task is to give out the path which costs minimum seconds for Ignatius to reach target position. You may assume that the start position and the target position will never be a trap, and there will never be a monster at the start position.

Input

The input contains several test cases. Each test case starts with a line contains two numbers N and M(2<=N<=100,2<=M<=100) which indicate the size of the labyrinth. Then a N*M two-dimensional array follows, which describe the whole labyrinth. The input is terminated by the end of file. More details in the Sample Input.

Output

For each test case, you should output “God please help our poor hero.” if Ignatius can’t reach the target position, or you should output “It takes n seconds to reach the target position, let me show you the way.”(n is the minimum seconds), and tell our hero the whole path. Output a line contains “FINISH” after each test case. If there are more than one path, any one is OK in this problem. More details in the Sample Output.

Sample Input

5 6
.XX.1.
..X.2.
2...X.
...XX.
XXXXX.
5 6
.XX.1.
..X.2.
2...X.
...XX.
XXXXX1
5 6
.XX...
..XX1.
2...X.
...XX.
XXXXX.

Sample Output

It takes 13 seconds to reach the target position, let me show you the way.
1s:(0,0)->(1,0)
2s:(1,0)->(1,1)
3s:(1,1)->(2,1)
4s:(2,1)->(2,2)
5s:(2,2)->(2,3)
6s:(2,3)->(1,3)
7s:(1,3)->(1,4)
8s:FIGHT AT (1,4)
9s:FIGHT AT (1,4)
10s:(1,4)->(1,5)
11s:(1,5)->(2,5)
12s:(2,5)->(3,5)
13s:(3,5)->(4,5)
FINISH
It takes 14 seconds to reach the target position, let me show you the way.
1s:(0,0)->(1,0)
2s:(1,0)->(1,1)
3s:(1,1)->(2,1)
4s:(2,1)->(2,2)
5s:(2,2)->(2,3)
6s:(2,3)->(1,3)
7s:(1,3)->(1,4)
8s:FIGHT AT (1,4)
9s:FIGHT AT (1,4)
10s:(1,4)->(1,5)
11s:(1,5)->(2,5)
12s:(2,5)->(3,5)
13s:(3,5)->(4,5)
14s:FIGHT AT (4,5)
FINISH
God please help our poor hero.
FINISH

题目题意:题目给了我们一个图，然我们求出一条最短时间的路从左上角到右下角，如果有，输出路径，没有输出那段话。

题目分析:我们从起点出发进行BFS搜索，但是我们要把点保存到优先队列中，因为我们要使得时间最短，把时间短放在前面，我们还要用一个结构体数组保存路径上每一个点的前一个点的坐标用于输出路径。

代码如下:

#include<iostream>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<queue>
#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn=100+10;
struct note
{
    int x,y;
    int step;
    bool operator<(const note& a) const{//用于排序
        return step>a.step;
    }
};
char mmap[maxn][maxn];
bool vis[maxn][maxn];
struct note ans[maxn][maxn];//保存坐标
int Next[4][2]={
   {-1,0},{1,0},{0,-1},{0,1}};
int n,m,res,sec;
priority_queue<struct note> que;
void bfs()
{
    while (que.size()) que.pop();
    struct note s;
    s.x=s.y=s.step=0;
    que.push(s);
    vis[0][0]=true;
    while (que.size()) {
        struct note cur,next;
        cur=que.top();
        que.pop();
        if (cur.x==n-1&&cur.y==m-1) {
            res=cur.step;
            return;
        }
        for (int i=0;i<4;i++) {
            int dx=cur.x+Next[i][0];
            int dy=cur.y+Next[i][1];
            next.x=dx,next.y=dy;
            if (dx<0||dx>=n||dy<0||dy>=m||vis[dx][dy]||mmap[dx][dy]=='X') continue;
            ans[dx][dy].x=cur.x,ans[dx][dy].y=cur.y;//记录前一个点的坐标
            vis[dx][dy]=true;
            next.step=cur.step+1;
            if (mmap[dx][dy]>='1'&&mmap[dx][dy]<='9')
                next.step+=mmap[dx][dy]-'0';
            que.push(next);
        }
    }
}
void show(int a,int b)//递归输出路径
{
    if (ans[a][b].x!=0||ans[a][b].y!=0)
        show (ans[a][b].x,ans[a][b].y);
     printf("%ds:(%d,%d)->(%d,%d)\n",++sec,ans[a][b].x,ans[a][b].y,a,b);
    if (mmap[a][b]>='1'&&mmap[a][b]<='9') {
       int cnt=mmap[a][b]-'0';
       for (int i=0;i<cnt;i++) {
            printf("%ds:FIGHT AT (%d,%d)\n",++sec,a,b);
        }
    }
}
int main()
{
    while (scanf("%d%d",&n,&m)!=EOF) {
        for (int i=0;i<n;i++)
            scanf("%s",mmap[i]);
        memset (vis,false,sizeof (vis));
        memset (ans,0,sizeof (ans));
        res=sec=0;
        bfs();
        if (res==0)
            printf("God please help our poor hero.\n");
        else {
            printf("It takes %d seconds to reach the target position, let me show you the way.\n",res);
            show(n-1,m-1);
        }
        printf("FINISH\n");
    }
    return 0;
}