码迷,mamicode.com
首页 > 其他好文 > 详细

hdu 1026 Ignatius and the Princess I 广搜+优先队列+记录路径

时间:2015-03-04 11:12:13      阅读:201      评论:0      收藏:0      [点我收藏+]

标签:hdu1026   ignatius and the pri   bfs   优先队列   

Ignatius and the Princess I

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 13414    Accepted Submission(s): 4232
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
 
哎。。。刚做这题时,可坑了,深搜超时,只能改广搜了

代码:
#include <stdio.h>
#include <limits.h>
#include <string.h>
#include <queue>
#define MAX 110
using namespace std ;
const int dir[4][2]={-1,0,1,0,0,-1,0,1} ;
int m , n , visited[MAX][MAX];
char map[MAX][MAX] ;
struct Point{
	int x , y , step;
	bool operator<(const Point &p) const
	{
		return step>p.step ;
	}
} ;
struct Pre{
	int x , y ;
}pre[MAX][MAX] ;
bool judge(Point p)
{
	if(p.x<0||p.y<0||p.x>=n||p.y>=m)
	{
		return false ;
	}
	return true ;
}
void BFS()
{
	Point s ;
	s.x = n-1;
	s.y = m-1;
	s.step = 0 ;
	visited[n-1][m-1] = 0 ;
	pre[s.x][s.y].x = pre[s.x][s.y].y = -1 ;
	priority_queue<Point> que ;
	que.push(s) ;
	while(!que.empty())
	{
		Point now = que.top();
		que.pop() ;
		if(now.x == 0 && now.y == 0)
		{
			int x = now.x ;	
			int y = now.y ;	
			int t = 1 ;
			if(map[n-1][m-1]>'0' && map[n-1][m-1]<='9')
				printf("It takes %d seconds to reach the target position, let me show you the way.\n",now.step+map[n-1][m-1]-'0');
			else
				printf("It takes %d seconds to reach the target position, let me show you the way.\n",now.step);
			while(pre[x][y].x != -1)
			{
				int tempx = pre[x][y].x ;
				int tempy = pre[x][y].y ;
				printf("%ds:(%d,%d)->(%d,%d)\n",t++,x,y,tempx,tempy) ;
				if(map[tempx][tempy] != '.')
				{
					for(int i = 0 ; i < map[tempx][tempy]-'0' ; ++i)
					{
						printf("%ds:FIGHT AT (%d,%d)\n",t++,tempx,tempy) ;
					}
				}
				x = tempx ;
				y = tempy ;
			}
			return ;
		}
		for(int i = 0 ; i < 4 ; ++i)
		{
			Point next ;
			next.x = now.x + dir[i][0];
			next.y = now.y + dir[i][1] ;
			if(!judge(next) || map[next.x][next.y]=='X')
			{
				continue ;
			}
			if(map[next.x][next.y]>'0' && map[next.x][next.y]<='9')
			{
				if(visited[next.x][next.y]==-1||visited[next.x][next.y]>now.step+1+map[next.x][next.y]-'0')
				{
					visited[next.x][next.y] = now.step+1+map[next.x][next.y]-'0' ;
					pre[next.x][next.y].x = now.x ;
					pre[next.x][next.y].y = now.y ;
					next.step = now.step+1+map[next.x][next.y]-'0';
					que.push(next) ;
				}
			}
			else
			{
				if(visited[next.x][next.y]==-1||visited[next.x][next.y]>now.step+1)
				{
					visited[next.x][next.y] = now.step+1 ;
					pre[next.x][next.y].x = now.x ;
					pre[next.x][next.y].y = now.y ;
					next.step = now.step+1 ;
					que.push(next) ;
				}
			}
		}
	}
	puts ("God please help our poor hero."); 
}

int main()
{
	while(~scanf("%d%d",&n,&m))
	{
		memset(visited,-1,sizeof(visited)) ;
		for(int i = 0 ; i < n ; ++i)
		{
			scanf("%s",map[i]);
		}
		BFS() ;
		puts("FINISH") ;
	}
	return 0 ;
}
/*
5 6
.XX.1.
..X.5.
2...4.
...XX.
XXXXX.
13

6 7
.XX.1.X
..X.5.X
2...4.2
...XX.X
XXXXX3.
..XXX.1
19

*/


hdu 1026 Ignatius and the Princess I 广搜+优先队列+记录路径

标签:hdu1026   ignatius and the pri   bfs   优先队列   

原文地址:http://blog.csdn.net/lionel_d/article/details/44056029

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!