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): 9433 Accepted Submission(s): 2784
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.
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
Author
Ignatius.L
据说这道题要用优先队列写。可当时还没学。所以就没用直接一秒一秒bfs的。不过结果是好的。
#include <iostream>
#include<stdio.h>
#include<string.h>
using namespace std;
int m,n,f,r,times;
int dx[4]= {-1,1,0,0};
int dy[4]= {0,0,1,-1};
struct node
{
int x,y;
int pre;//记录上个结点的标号方便记录路径
} q[1000110];
char maze[110][110];//存地图
int vis[110][110];//标记
void bfs()
{
int nx,ny,i;
f=r=0;
q[r].x=q[r].y=0;
q[r].pre=0;
vis[0][0]=1;
r++;
while(f<r)//注意是小于不能等于！不然死循环
{
nx=q[f].x;//当前位置
ny=q[f].y;
if(maze[nx][ny]<=9&&maze[nx][ny]!=0)//如果是数字
{
maze[nx][ny]--;//怪物减生命值
q[r].x=nx;//怪物没死还是要入队
q[r].y=ny;
q[r].pre=f;
r++;
}
else
{
for(i=0; i<4; i++)
{
nx=q[f].x+dx[i];//不是数字就可以随意走了
ny=q[f].y+dy[i];
if(nx==n-1&&ny==m-1)//如果到终点了
{
if(maze[nx][ny]=='.')//终点不是怪物
{
vis[nx][ny]=1;
q[r].x=nx;
q[r].y=ny;
q[r].pre=f;
}
else//终点是怪物
{
maze[nx][ny]-='0';
maze[nx][ny]+=1;
vis[nx][ny]=1;
while(maze[nx][ny]!=0)
{
q[r].x=nx;
q[r].y=ny;
q[r].pre=f;
f=r;
r++;
maze[nx][ny]--;
}
r--;
}
return;
}
if(nx<0||nx>=n||ny<0||ny>=m||maze[nx][ny]=='X'||vis[nx][ny])
continue;
if(maze[nx][ny]>='0'&&maze[nx][ny]<='9')
maze[nx][ny]-='0';
vis[nx][ny]=1;
q[r].x=nx;
q[r].y=ny;
q[r].pre=f;
r++;
}
}
f++;
}
}
void print(int pos)//输出路径
{
int x,y,px,py,past;
past=q[pos].pre;
x=q[pos].x;
y=q[pos].y;
px=q[past].x;
py=q[past].y;
if(x==0&&y==0)
return;
print(q[pos].pre);
if(maze[x][y]==0&&maze[px][py]==0&&x==px&&y==py)//这里失误鸟。是在同一处打怪
printf("%ds:FIGHT AT (%d,%d)\n",times++,x,y);
else
printf("%ds:(%d,%d)->(%d,%d)\n",times++,q[past].x,q[past].y,x,y);
}
int main()
{
int i,j,cnt,s;
while(~scanf("%d%d",&n,&m))
{
getchar();
memset(vis,0,sizeof vis);
times=1;
cnt=1;
for(i=0; i<n; i++)
{
for(j=0; j<m; j++)
scanf("%c",&maze[i][j]);
getchar();
}
bfs();
if(!vis[n-1][m-1])
printf("God please help our poor hero.\nFINISH\n");
else
{
s=r;
while(q[s].pre!=0)
{
s=q[s].pre;
cnt++;
}
printf("It takes %d seconds to reach the target position, let me show you the way.\n",cnt);
print(r);
printf("FINISH\n");
}
}
return 0;
}