HDU-1026 Ignatius and the Princess I（广搜+优先队列+输出路径）

最新推荐文章于 2024-07-22 10:30:00 发布

原创最新推荐文章于 2024-07-22 10:30:00 发布 · 463 阅读

2 ·

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

广搜专栏收录该内容

4 篇文章

订阅专栏

本文介绍了一种使用优先队列解决迷宫寻径问题的方法，旨在寻找从起点到终点的最短路径并输出路径详情。文章详细解释了如何定义迷宫地图及其中的障碍物与怪物，利用结构体节点进行路径探索，同时记录每一步的操作。

Ignatius and the Princess I

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 20113 Accepted Submission(s): 6553
Special Judge

Problem Description

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

题意：Ignatius从（0，0）位置出发去营救公主（m-1，n-1），要求用时最短也就是最短路径，并输出路径，如果不能营救出公主输出“God please help our poor hero.” 根据题意，' . '代表路，‘X’代表坑，‘数字’代表打倒这个位置的怪兽需要多长时间，因为每一个位置所代表的时间不相同所以采用优先队列。

由于还需要输出路径所以就需要记录路径，考虑用一个数组记录路径，通过递归将路径输出。

#include<stdio.h>
#include<string.h>
#include<queue>
#include<algorithm>
using namespace std;

struct node
{
    int x;
    int y;
    int step;
    friend bool operator<(node a,node b)
    {
        return a.step>b.step;
    }
};

struct Node//记录路径
{
    int x,y,step;
}ans[110][110];

int Map[110][110];
int m,n;
int a[110],b[110];
int dir[4][2] = {0,1,1,0,0,-1,-1,0};
int book[110][110] ;

void Ans(int x,int y,int &cnt)
{
    if(ans[x][y].x >= 0&& ans[x][y].y>=0)
    {
        Ans(ans[x][y].x , ans[x][y].y , cnt);
        printf("%ds:(%d,%d)->(%d,%d)\n",cnt++ , ans[x][y].x , ans[x][y].y , x , y);
        if(Map[x][y]>1)
            for(int i = 0; i < Map[x][y]-1; i ++)
                printf("%ds:FIGHT AT (%d,%d)\n",cnt++,x,y);
    }
}

void bfs(int x,int y,int step)
{
    node now,tmp;
    priority_queue<node> q;
    now.x = x;
    now.y = y;
    now.step = step;
    q.push(now);
    ans[now.x][now.x].x = -1;//开始的点
    ans[now.x][now.x].y = -1;
    while(!q.empty())
    {
        now = q.top();
        q.pop();

        if(now.x == m-1 && now.y == n-1)//找到公主
        {
            int cnt = 1;//为了时间
            printf("It takes %d seconds to reach the target position, let me show you the way.\n",now.step);
            Ans(m-1,n-1,cnt);
            printf("FINISH\n");
            return ;
        }
        for(int i = 0; i < 4; i ++)
        {
            int tx = now.x + dir[i][0];
            int ty = now.y + dir[i][1];
            if(book[tx][ty] || tx >=m || tx<0 || ty >= n || ty< 0 || Map[tx][ty] == -1)
                continue;
            tmp.step = now.step+Map[tx][ty];
            book[tx][ty] = 1;
            tmp.x = tx;
            tmp.y = ty;
            q.push(tmp);
            ans[tx][ty].x = now.x;
            ans[tx][ty].y = now.y;
        }
    }
    printf("God please help our poor hero.\n");
    printf("FINISH\n");
}

int main()
{
    while(~scanf("%d%d",&m,&n))
    {

        int i,j,k;
        char s[110];
        for(i = 0; i < m; i ++)//先将每个位置初始化为对应的时间
        {
            scanf("%s",s);
            for(j = 0; j < n; j ++)
            {
                if(s[j]=='.') Map[i][j] = 1;
                else if(s[j]=='X') Map[i][j] = -1;
                else Map[i][j] = s[j]-'0'+1;
            }
        }
        memset(book,0,sizeof(book));
        book[0][0] = 1;
        bfs(0,0,0);
    }
}