Ignatius andthe Princess I
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 17527 Accepted Submission(s): 5615
Special Judge
Problem Description
The Princess has been abducted bythe 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), andthe door to feng5166's room isat (N-1,M-1), thatis our target. There are some monsters inthe castle, if Ignatius meet them, he has to kill them. Here issome 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 withsomecharactersand numbers. We define them like this:
. : The place where Ignatius can walk on.
X : The place is a trap, Ignatius should not walk onit.
n : Here is a monster with n HP(1<=n<=9), if Ignatius walk onit, it takes him n seconds to kill the monster.
Your task isto give out the path which costs minimum seconds for Ignatius to reach target position. You may assume thatthe start position andthe target position will never be a trap, and there will never be a monster atthe 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 ofthe labyrinth. Then a N*M two-dimensional array follows, which describe the whole labyrinth. The input is terminated bytheendoffile. More details inthe 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 isthe minimum seconds), andtell 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 inthe Sample Output.
Sample Input
56
.XX.1.
..X.2.
2...X.
...XX.
XXXXX.
56
.XX.1.
..X.2.
2...X.
...XX.
XXXXX1
56
.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<string.h>#include<queue>
using namespace std;
char Map[1000][1000];
bool vis[1000][1000];
const int dir[][2]={{1,0},{0,1},{-1,0},{0,-1}};
int N,M;
struct node
{
int x,y; int time;
friend bool operator<(nodea,nodeb)
{
returna.time>b.time;
}
int Step[1000][2];//走法的记录
};
void BFS()
{
memset(vis,0,sizeof(vis));
node p,q;
priority_queue <node>s;
p.time=p.y=p.x=0;
p.Step[0][1]=p.Step[0][0]=0;
vis[0][0]=true;
s.push(p);
while(!s.empty())
{
p=s.top();
if(p.x==N-1&&p.y==M-1)//到了终点
{
int x=0,y=0;
printf("It takes %d seconds to reach the target position, let me show you the way.\n",p.time);
for(int i=0;i<p.time;i++)
{
if(x==p.Step[i+1][0]&&y==p.Step[i+1][1])
{
printf("%ds:FIGHTAT (%d,%d)\n",i+1,x=p.Step[i+1][0],y=p.Step[i][1]);continue;
}
printf("%ds:(%d,%d)->(%d,%d)\n",i+1,p.Step[i][0],p.Step[i][1],x=p.Step[i+1][0],y=p.Step[i+1][1]);
}
printf("FINISH\n");
return ;
}
s.pop();
for(int i=0;i<4;i++)
{
q=p;q.x=p.x+dir[i][0];q.y=p.y+dir[i][1];if(q.x>=0&&q.y>=0&&q.y<M&&p.x<N&&!vis[q.x][q.y]&&Map[q.x][q.y]!='X')
{
if(Map[q.x][q.y]=='.')
{
q.time++;
intnum=q.time;q.Step[num][0]=q.x;q.Step[num][1]=q.y;vis[q.x][q.y]=true;s.push(q);
}
if(Map[q.x][q.y]>='1'&&Map[q.x][q.y]<='9')
{
q.time++;
intnum=q.time;intj=Map[q.x][q.y]-'0'+1;while(j--)
{
q.Step[q.time][0]=q.x;q.Step[q.time][1]=q.y;vis[q.x][q.y]=true;q.time++;
}
q.time--;
s.push(q);
}
}
}
}
printf("Godpleasehelpourpoorhero.\nFINISH\n");//如果没走到终点要对应输出语句。
}
intmain()
{
inti;
while(~scanf("%d%d",&N,&M))
{
for(i=0;i<N;i++)scanf("%s",Map[i]);
BFS();
}
return0;
}
Sample Input5 6.XX.1...X.2.2...X....XX.XXXXX.5 6.XX.1...X.2.2...X....XX.XXXXX15 6.XX.....XX1.2...X....XX.XXXXX.Sample OutputIt takes 13 seconds to reach the target position, let me