zoukankan      html  css  js  c++  java
  • hdu1026 Ignatius and the Princess I (优先队列 BFS)

    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
     
    #include<stdio.h>
    #include<queue>
    #include<stack>
    #include<iostream>
    using namespace std;
    typedef struct N
    {
        int i,j,time;
        char c;
        int fron,nam;
        friend bool operator<(N n1,N n2)
        {
            return n2.time<n1.time;
        }
    }node;
    node map[105][105];
    stack<node> S;
    int dir[4][2]={{1,0},{-1,0},{0,1},{0,-1}},h,w,maxT,flog;
    void InStack(node Map)
    {
        node q=Map;
        while(q.fron!=-1)
        {
            S.push(q);
            q=map[q.fron/w][q.fron%w];
    
        }
        S.push(q);
        //printf("%d
    ",p);
    }
    void BFS(void)
    {
        priority_queue<node> Q;
        node q,p;
        int e,x,y,k,i;
        map[0][0].c='X'; map[0][0].fron=-1;
        q.i=0;q.j=0;q.time=0;
        Q.push(q);
        while(!Q.empty())
        {
            q=Q.top();
            Q.pop();
            k=0;
            for(e=0;e<4;e++)
            {
                y=q.i+dir[e][0];
                x=q.j+dir[e][1];
                if(y>=0&&y<h&&x>=0&&x<w&&map[y][x].c!='X')
                {
                    map[y][x].fron=map[q.i][q.j].nam;
    
                    if(map[y][x].c=='.')
                    map[y][x].time=q.time+1;
                    else
                    map[y][x].time=q.time+map[y][x].c-'0'+1;
                        map[y][x].c='X';
                    p.i=y; p.j=x;p.time=map[y][x].time;
                if(p.i==h-1&&p.j==w-1)
                    {
                       maxT=map[h-1][w-1].time;
                        InStack(map[h-1][w-1]);
                        flog=1;
                        //printf("%d
    ",maxT);
                        return ;
                    }
    
                    Q.push(p);
                }
            }
        }
    }
    int main()
    {
        int i,j,t;
        node q,p;
        while(scanf("%d%d",&h,&w)>0)
        {
            t=0;
            for(i=0;i<h;i++)
            {
                getchar();
                for(j=0;j<w;j++)
                {
                    scanf("%c",&map[i][j].c);
                    map[i][j].i=i; map[i][j].j=j;
                    map[i][j].nam=t++;
                }
            }
            if(map[h-1][w-1].c=='X')
            {
                printf("God please help our poor hero.
    ");
                printf("FINISH
    ");
                continue ;
            }
            flog=0;
            BFS();
            if(!flog)
            printf("God please help our poor hero.
    ");
            else
            {
                p=S.top();
                S.pop();//printf("%d
    ",map[1][4].time);
                printf("It takes %d seconds to reach the target position, let me show you the way.
    ",maxT);
                for(i=1;i<=maxT;i++)
                {
                    if(p.time<i)
                    {
                        q=S.top();
                        S.pop();
                    }
                    if(p.time<i)
                    printf("%ds:(%d,%d)->(%d,%d)
    ",i,p.i,p.j,q.i,q.j);
                    else
                    printf("%ds:FIGHT AT (%d,%d)
    ",i,p.i,p.j);
                    p=q;
                }
            }
            printf("FINISH
    ");
        }
    }
    



  • 相关阅读:
    第8章 降维
    第7章 集成学习和随机森林
    JS利用async、await处理少见的登录业务逻辑
    SQL SERVER 实现多行转多列
    Mysql函数----控制流函数介绍
    继承----静态代码快、构造方法、代码块、普通方法的执行顺序
    RBAC----基于角色的访问权限控制
    秋招-----思特沃克视频面试总结
    tomcat启动失败的三种方法
    索引之----mysql联合索引
  • 原文地址:https://www.cnblogs.com/riskyer/p/3233793.html
Copyright © 2011-2022 走看看