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): 18832    Accepted Submission(s): 6084
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,y可能为两位数的情况错了好多次，还是要细心。。
  
  
  
  

   
   
#include<stdio.h>
#include<queue>
#include<string>
#include<string.h>
using namespace std;
int m,n;
char map[110][110];
bool vis[110][110];
int v[4][2]={-1,0,1,0,0,-1,0,1}; 
struct Node
{
	int x,y;
	int cost;
	string path;//保存路径 
	Node(){}
	Node(int _x,int _y,int _cost,string _str)
	{
		x=_x;
		y=_y;
		cost=_cost;
		path=_str;
	}
	friend bool operator<(Node a,Node b)
	{
		return a.cost>b.cost;
	}
};
char toChar(int n)//x,y,cost,a,b<10 
{
	
	return n+'0';
}
string toString(int n)//考虑x,y,cost,a,b可能为两位数的情况 
{
	string str="";
	if(n<=9) 
		     str+=toChar(n);
		else 
		{
			int num[20];
			int count=0;
			int cost2=n;
			while(cost2>0)
			{
				num[count++]=cost2%10;
				cost2=cost2/10;
			}
			for(int i=count-1;i>=0;i--)
			 {
			 //	printf("%d ",num[i]);
			 	str+=toChar(num[i]);
			 }//printf("\n");
		}
	return str;
}
string addPath(int x,int y,int a,int b,int cost)
{   string str="";
   // str+=toChar(cost);
    if(cost<=9) 
		     str+=toChar(cost);
	    else 
	         str+=toString(cost);
    str+="s:";
	str+='(';
	if(x<=9)
	      str+=toChar(x);
    else   
	      str+=toString(x);
	str+=',';
	if(y<=9)
	     str+=toChar(y);
    else 
	     str+=toString(y);
	str+=')';
	str+='-';
	str+='>';
	str+='(';
	if(a<=9)
	     str+=toChar(a);
    else 
	     str+=toString(a);
	str+=',';
	if(b<=9)
	     str+=toChar(b);
    else 
	     str+=toString(b);
	str+=')';
	str+='\n';
	return str;
} 
string addFight(int n,int x,int y,int cost)
{
	string str="";
	for(int i=0;i<n;i++)
	{   ++cost;
	  //printf("cost==%d\n",cost);
		if(cost<=9) 
		     str+=toChar(cost);
		else 
	         str+=toString(cost);
		str+="s:FIGHT AT ";
		str+='(';
		if(x<=9)
	        str+=toChar(x);
       else   
	        str+=toString(x);
		str+=',';
		if(y<=9)
	         str+=toChar(y);
        else   
	         str+=toString(y);
		str+=')';
		str+='\n';
	}
    return str;
}
void bfs()
{
	priority_queue<Node> q;
	int a=0;
	if(map[0][0]>'0'&&map[0][0]<='9') a=map[0][0]-'0';//入口有怪兽 
	q.push(Node(0,0,a,""));
	vis[0][0]=true;
	bool flag=false;
	while(!q.empty())
	{
		Node node=q.top();
		q.pop();
		int x=node.x;
		int y=node.y;
		int cost=node.cost;
		string path=node.path;
//		printf("x==%d y==%d\n",x,y);
		if(x==n-1&&y==m-1)//结束条件 
		{
			printf("It takes %d seconds to reach the target position, let me show you the way.\n",node.cost);
		       //	It takes %d seconds to reach the target position, let me show you the way.
			for(int i=0;i<path.length();i++)
			        printf("%c",path[i]);
		    flag=true;
			break;
		}
		for(int i=0;i<4;i++)
		{
			int xx=x+v[i][0];
			int yy=y+v[i][1];
			cost=node.cost+1;
			path=node.path;
			if(xx<0||xx>=n||yy<0||yy>=m||vis[xx][yy]||map[xx][yy]=='X') continue;//边界条件 
			vis[xx][yy]=true;
			path+=addPath(x,y,xx,yy,cost);//添加路径 
		//	for(int i=0;i<path.length();i++) printf("%c",path[i]);
			if(map[xx][yy]>'0'&&map[xx][yy]<='9')//遇到怪兽 
			{
				int num=map[xx][yy]-'0';
	//			printf("num==%d\n",num);
				path+=addFight(num,xx,yy,cost); //添加战斗 
				cost+=num;
			}   
			q.push(Node(xx,yy,cost,path));
		}	
	}
	if(!flag) printf("God please help our poor hero.\n");
	printf("FINISH\n");
}
int main()
{
	while(~scanf("%d%d",&n,&m))
	{
		memset(vis,false,sizeof(vis));
		for(int i=0;i<n;i++)
		{
	         scanf("%s",map[i]);
		}
		bfs();
	}
}
/*
15 15
...............
...............
...............
...............
...............
...............
...............
...............
...............
...............
...............
...............
...............
...............
...............
*/