HDU1026 Ignatius and the Princess I 优先队列宽搜+路径输出

K - Ignatius and the Princess I

Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u

Submit  Status

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<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<queue>
#include<string>
using namespace std;
const int INF=0x3f3f3f3f;
const int MAXN=105;
const int MAXM=105;
int n,m,i;
int done[MAXN][MAXM];
int sx,sy,ex,ey;
char map[MAXN][MAXM];
int dx[]={0,0,1,-1};
int dy[]={1,-1,0,0};
int en,p[MAXN][MAXM];

struct node
{
	int x,y,w,id,pre;
	node(int xx=0,int yy=0,int ww=0,int i=0,int pr=0)
	{
		x=xx;y=yy;w=ww;id=i;pre=pr;
	}
	friend bool operator<(const node &a,const node &b)
	{
		return a.w>b.w;
	}
}que[10010];
bool is_ill(int x,int y)
{
	if(x<0||x>=n||y<0||y>=m)return 1;
	return 0;
}
int bfs()
{
    priority_queue<node> q;
    en=0;
    que[en].x=0,que[en].y=-1,que[en].w=-1;
    que[en].pre=-1;
    q.push(que[en++]);
    memset(done,0,sizeof(done));
    while(!q.empty())
    {
        node e=q.top();
        q.pop();
        for(int i=0;i<4;i++)
        {
            int x=e.x+dx[i];
            int y=e.y+dy[i];
            if(!is_ill(x,y)&&!done[x][y]&&map[x][y]!='X')
            {
                que[en].x=x;
                que[en].y=y;
                que[en].id=en;
                que[en].w=e.w+(map[x][y]=='.'?1:map[x][y]-'0'+1);
                que[en].pre=e.id;
                if(x==n-1 && y==m-1)
                    return en;
                q.push(que[en++]);
                done[x][y]=1;
            }
        }
    }
    return -1;
}
void showpath(int id)
{
    int pre=que[id].pre;
    int x=que[id].x;
    int y=que[id].y;
    int px=que[pre].x;
    int py=que[pre].y;
    if(que[id].pre==1)
    {
        printf("%ds:(%d,%d)->(%d,%d)\n",que[pre].w+1,px,py,x,y);
        if(map[x][y]!='.')
        {
            int w=map[x][y]-'0';
            for(int i=1;i<=w;i++)
                printf("%ds:FIGHT AT (%d,%d)\n",que[pre].w+i+1,x,y);
        }
    }
    else
    {
        showpath(pre);
        printf("%ds:(%d,%d)->(%d,%d)\n",que[pre].w+1,px,py,x,y);
        if(map[x][y]!='.')
        {
            int w=map[x][y]-'0';
            for(int i=1;i<=w;i++)
                printf("%ds:FIGHT AT (%d,%d)\n",que[pre].w+i+1,x,y);
        }
    }
}
int main()
{
	//freopen("123.txt","r",stdin);
	while(~scanf("%d%d\n",&n,&m))
	{
		
		for(i=0;i<n;i++)
			gets(map[i]);
		sx=sy=0;
		ex=n-1;ey=m-1;
		int ans;
		if(map[0][0]=='X'||map[n-1][m-1]=='X')ans=-1;
		else ans=bfs();
		if(ans>=0)
		{
			printf("It takes %d seconds to reach the target position, let me show you the way.\n",que[ans].w);
			showpath(ans);
		}
		else printf("God please help our poor hero.\n");
		printf("FINISH\n");
	}
	return 0;
}