hdoj 1026 Ignatius and the Princess I【bfs&&路径输出】

原创 2015年11月18日 22:00:36


Ignatius and the Princess I

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 15122    Accepted Submission(s): 4811
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
分析:
bfs果题,加上路径输出。
代码:
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<queue>
#include<stack>
#define mem(x,y) memset(x,y,sizeof(x));
using namespace std;

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

int map[110][110];
int flag[110][110];
int cnt[110][110];//记录野怪的血量
int dis[4][2]={1,0,-1,0,0,1,0,-1};
int n,m,tim;
bool judge(int a,int b)
{
    if(a<0||a>=n||b<0||b>=m)
        return true;
    if(map[a][b]==-1)
        return true;
    return 0;
}
int bfs()
{
    int i;
    priority_queue<node>q;
    node a,b;
    a.x=0;
    a.y=0;
    a.step=0;
    map[0][0]=-1;
    q.push(a);
    while(!q.empty())
    {
        a=q.top();
        q.pop();
        if(a.x==n-1&&a.y==m-1)
            return a.step;
        for(i=0;i<4;i++)
        {
            b=a;
            b.x+=dis[i][0];
            b.y+=dis[i][1];
            if(judge(b.x,b.y))
                continue;
            b.step=a.step+map[b.x][b.y]+1;
            map[b.x][b.y]=-1;
            flag[b.x][b.y]=i+1;
            q.push(b);
        }
    }
    return 0;
}
void print(int x,int y)
{
    int nx,ny;
    if(!flag[x][y])
        return;
    nx=x-dis[flag[x][y]-1][0];
    ny=y-dis[flag[x][y]-1][1];
    print(nx,ny);
    printf("%ds:(%d,%d)->(%d,%d)\n",tim++,nx,ny,x,y);
    while(cnt[x][y]--)
    {
        printf("%ds:FIGHT AT (%d,%d)\n",tim++,x,y);
    }
}
int main()
{
    int i,j;
    while(scanf("%d%d",&n,&m)!=EOF)
    {
        mem(map,0);
        mem(flag,0);
        mem(cnt,0);
        char s[110];
        for(i=0;i<n;i++)
        {
            scanf("%s",s);
            for(j=0;s[j];j++)
            {
                if(s[j]=='.')
                    map[i][j]=0;
                else if(s[j]=='X')
                    map[i][j]=-1;
                else map[i][j]=cnt[i][j]=s[j]-'0';            }
        }
        int ans=bfs();
        if(ans)
        {
            printf("It takes %d seconds to reach the target position, let me show you the way.\n",ans);
            tim=1;
            print(n-1,m-1);
        }
        else printf("God please help our poor hero.\n");
        printf("FINISH\n");
    }
    system("pause");
  return 0;
}

 
版权声明:博主情人,外人误碰!!!

杭电 hdu 1026 Ignatius and the Princess I(BFS+优先队列+墨迹人的输出)

Ignatius and the Princess I Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (...
  • mengxiang000000
  • mengxiang000000
  • 2016年01月19日 12:23
  • 1126

HDU1026 Ignatius and the Princess I(java)

HDU1026(java)
  • sxd8700
  • sxd8700
  • 2015年09月23日 21:31
  • 289

HDU - 1026 Ignatius and the Princess I

题意:求在最短的时间内从左上角到右下角,每到达一个格子都要停留格子上的时间,每移动一次也都要一个单位时间,并打印每一秒所在的格子和路径 思路:在BFS的基础上还要加上优先队列来求最短的时间 #in...
  • u011345136
  • u011345136
  • 2014年03月17日 19:50
  • 649

HDU 1026 Ignatius and the Princess I (BFS)

Ignatius and the Princess I Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (J...
  • liangzhaoyang1
  • liangzhaoyang1
  • 2016年05月28日 16:04
  • 504

经典好题!杭电OJ--Ignatius and the Princess I

Ignatius and the Princess I Problem Description The Princess has been abducted by the BEelzebu...
  • lishuhuakai
  • lishuhuakai
  • 2012年10月05日 14:54
  • 3450

Hdoj 1026 Ignatius and the Princess I

题目传送门///bfs跑路,dfs记录路径 #include #include #include #include #include using namespace std;char maze[105...
  • just_sort
  • just_sort
  • 2015年10月22日 13:13
  • 351

HDOJ 1026 Ignatius and the Princess I

当时做的时候wa了很多次。。。orz 题意:     要求从(0,0)走到(n-1,m-1)所花费的最短时间;     ‘.’是可以走的,消耗一个单位的时间,     ‘x’是不可以走的, ...
  • coder206
  • coder206
  • 2014年10月06日 20:17
  • 149

B - Ignatius and the Princess IV——POJ

B - Ignatius and the Princess IV Time Limit:1000MS     Memory Limit:32767KB     64bit IO Format:%I6...
  • chudongfang2015
  • chudongfang2015
  • 2016年05月11日 20:35
  • 444

HDOJ 1026 Ignatius and the Princess I (BFS + 优先队列 + 输出路径)

Ignatius and the Princess I Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (J...
  • my_sunshine26
  • my_sunshine26
  • 2017年04月03日 01:09
  • 92

HDOJ 1028 Ignatius and the Princess III

链接:http://acm.hdu.edu.cn/showproblem.php?pid=1028 题目: Ignatius and the Princess III Time Limi...
  • u010084308
  • u010084308
  • 2014年06月30日 16:02
  • 835
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:hdoj 1026 Ignatius and the Princess I【bfs&&路径输出】
举报原因:
原因补充:

(最多只允许输入30个字)