HDU 1026 Ignatius and the Princess I

Ignatius and the Princess I

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 19922    Accepted Submission(s): 6498
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
  
  

题意：   一个战士要去救公主  ，X 表示是墙 不能走 ， 数字1到9 表示在这里有个怪物  想要从这里走  必须打败这个怪物。 

费时为  数字   。问你最小时间救到公主  并且 输出路径。。 战士在0 0 点  公主在 n-1  m-1点。

优先队列  + bfs  寻找最短时间   。。  队列qq 记录走过的点，， 用下标寻址。。

代码： 

#include<stdio.h>
#include<string.h>
#include<queue>
#include<iostream>
#include<algorithm>
#define N 105
#define inf 0x3f3f3f

using namespace std;

struct node
{
	int x,y;
	int step;
	int id;
	int fa;
	bool operator < (const node a) const 
	{
		return step>a.step;
	}
}qq[N*N];

int ne[4][2]={1,0,0,1,-1,0,0,-1};
char map[N][N];
int vis[N][N];
int n,m;
int time;

bool ok(int x,int y)
{
	if(x>=0&&x<n&&y>=0&&y<m&&map[x][y]!='X'&&!vis[x][y]) return true;
	return false;
}

void output (int id)
{
	int pre=qq[id].fa;
	int px,py;
	px=qq[pre].x;
	py=qq[pre].y;
	//第一个点的坐标为 0 0 在qq队列中下标为 1 。 
	if(qq[id].fa!=1) output(qq[id].fa);// 找到第二个点。 
    int x=qq[id].x;
    int y=qq[id].y;
    
    printf("%ds:(%d,%d)->(%d,%d)\n",++time,px,py,x,y);
    if (map[x][y]!='.')
    {
        int t=map[x][y]-'0';
        for (int i=1;i<=t;i++)
            printf("%ds:FIGHT AT (%d,%d)\n",++time,x,y);
    }
}

void bfs()
{
	memset(vis,0,sizeof(vis));
	int x,y,tx,ty,step,fa;
	int fin=inf;
	int minn=inf;
	
	node tmp;
	int tail=1;
	
	priority_queue< node >q;
	tmp.fa=-1; tmp.step=0; tmp.x=0; tmp.y=0; tmp.id=tail;
	
	q.push(tmp);
	qq[tail++]=tmp;//qq 队列记录所有走过的点  。  每个点有其下标  ，所以可以通过访问下标 找到  最初的 0 0 点。 
	vis[0][0]=1;
	
	while(!q.empty())
	{
		tmp=q.top();
		q.pop();
		x=tmp.x;  y=tmp.y;  step=tmp.step; fa=tmp.id;
		if(x==n-1&&y==m-1)
		{
			fa=tmp.id;
			minn=step;
			break;
		}
		for(int i=0;i<4;i++)
		{
			tx=x+ne[i][0];
			ty=y+ne[i][1];
			if(ok(tx,ty))
			{
				vis[tx][ty]=1;
				tmp.fa=fa; tmp.x=tx; tmp.y=ty;
				tmp.id=tail;
				if(map[tx][ty]>='1'&&map[tx][ty]<='9')
				{
					tmp.step=step+map[tx][ty]-'0'+1;
				}
				else tmp.step=step+1;
				qq[tail++]=tmp;
				q.push(tmp);
			}
		}
		
	}
	if(minn==inf)
	{
		printf("God please help our poor hero.\n");
		printf("FINISH\n");
		return ;
	}
	
	printf("It takes %d seconds to reach the target position, let me show you the way.\n",minn);
	time=0;
	
	output(fa);
	printf("FINISH\n");
	return ;
}

int main()
{
	
	while(scanf("%d %d",&n,&m)!=EOF)
	{
	
	
	for(int i=0;i<n;i++)
	{
		scanf("%s",map[i]);
	}
	bfs();
	
	}
	
	return 0;
}