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 优先队列+路径输出)

给一个 N*M 的四方向连通的图, 要从左上角走到右下角,. : 代表可以走,X :  表示是墙,不可以走,n :  代表这里有一个怪兽,打败怪兽用时 n,每走一步耗时 1 .如果能到达,则输出最小时...

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 (...

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...

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 (...

HDU1026 Ignatius and the Princess I 【BFS】+【路径记录】

Ignatius and the Princess I Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (...

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 (...

HDU 1026Ignatius and the Princess I(bfs+记录路径)

题目地址:http://acm.hdu.edu.cn/showproblem.php?pid=1026 这题you

hdu1026 Ignatius and the Princess I BFS之打印路径 虐死我得一个题

Ignatius and the Princess I Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (...

HDU 1026 Ignatius and the Princess I && BFS+记录路径

上课的时候,想找一道水题随便写写玩玩,没想到WA了,之后我改了一天也没找到错误在哪,没办法只好推到重写了,就莫名A了,我还是太菜了。。。 题意:给你一张地图,'.'表示可以走的路,'X'表示不可以走的...

hdu1026 Ignatius and the Princess I --BFS & 记录路径 & 与DFS的比较

原题链接: http://acm.hdu.edu.cn/showproblem.php?pid=1026 一:题意 一个n*m的矩阵代表一个迷宫,(0,0)是起点,(n-1)(m-...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

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