HDU 1026 Ignatius and the Princess I BFS 优先队列
2017-03-12 15:40
375 查看
Ignatius and the Princess I
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 18557 Accepted Submission(s): 5976
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
Author
Ignatius.L
Recommend
We have carefully selected several similar problems for you: 1072 1175 1010 1180 1240
用优先队列
优先队列解析看有个大神讲的不错http://www.cnblogs.com/heqinghui/archive/2013/07/30/3225407.html
ac代码:
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <iostream>
#include <queue>
using namespace std;
struct node{
int x,y,step;
friend bool operator<(node n1,node n2)
{
return n2.step<n1.step;
}
};
int map[105][105];
int flag[105][105];//记录方向
int cnt[105][105];//记录怪物血量
int n,m,tim;
int dir[4][2]={1,0,-1,0,0,1,0,-1};
int check(node a)
{
if(a.x < 0 || a.y < 0 || a.x >= n || a.y >= m)
return 1;
if(map[a.x][a.y] == -1)
return 1;
return 0;
}
int bfs()
{
int i;
priority_queue<node> Q;
node a;
a.x=0;
a.y=0;
a.step=0;
map[0][0]=-1;
Q.push(a);
while(!Q.empty())
{
a=Q.top();
Q.pop();
if(a.x == n-1 && a.y ==m-1)
return a.step;
for(i=0;i<4;i++)
{
node next;
next.x=a.x+dir[i][0];
next.y=a.y+dir[i][1];
if(check(next))
continue;
next.step=a.step+map[next.x][next.y]+1;
map[next.x][next.y]=-1;//标记走过 同时看看路径
flag[next.x][next.y]=i;//记录方向
Q.push(next);
}
}
return 0;
}
void print(int x,int y)
{
int n_x,n_y;
if(flag[x][y]==-1)
return;
n_x = x - dir[flag[x][y]][0];
n_y = y - dir[flag[x][y]][1];
print(n_x,n_y);
printf("%ds:(%d,%d)->(%d,%d)\n",tim++,n_x,n_y,x,y);
while(cnt[x][y]--)
{
printf("%ds:FIGHT AT (%d,%d)\n",tim++,x,y);
}
}
int main()
{
char s[105];
int i,j;
while(~scanf("%d%d",&n,&m))
{
memset(map,0,sizeof(map));
memset(flag,-1,sizeof(flag));
memset(cnt,0,sizeof(cnt));
for(i=0;i<n;i++)
{
scanf("%s",s);
for(j=0;s[j]!='\0';j++)
{
if(s[j]=='.')
map[i][j]=0;
else if(s[j]=='X')
map[i][j]=-1;
else
map[i][j]=cnt[i][j]=s[j]-'0';
}
}
int ans=0;
ans=bfs();
if(ans)
{
printf("It takes %d seconds to reach the target position, let me show you the way.\n",ans);
tim = 1;
print(n-1,m-1);
}
else
printf("God please help our poor hero.\n");
printf("FINISH\n");
}
}
相关文章推荐
- hdu 1026:Ignatius and the Princess I(优先队列 + bfs广搜。ps:广搜AC,深搜超时,求助攻!)
- hdu1026 Ignatius and the Princess I (优先队列 BFS)
- hdu1026 Ignatius and the Princess I (优先队列 BFS)
- HDU 1026 Ignatius and the Princess I 优先队列 +BFS.
- hdu 1026 Ignatius and the Princess I bfs 优先队列 路径记录
- hdu 1026 Ignatius and the Princess I (bfs记录路径 两种记录路径方法模拟优先队列和优先队列两种做法)
- HDU1026 Ignatius and the Princess I(广搜与优先队列)
- HDU--杭电--1026--Ignatius and the Princess I--广搜--直接暴力0MS,优先队列的一边站
- HDOJ 1026 Ignatius and the Princess I (BFS优先队列超时 TLE)
- HDU 1026 Ignatius and the Princess I 【优先队列+路径输出】
- HDU--杭电--1026--Ignatius and the Princess I--广搜--直接暴力0MS,优先队列的一边站
- HDU 1026 Ignatius and the Princess I (bfs + 优先队列 + 路径记录)
- 【搜索之BFS + 优先队列】杭电 hdu 1026 Ignatius and the Princess I
- HDU1026 Ignatius and the Princess I 优先队列
- HDU 1026 Ignatius and the Princess I - BFS + 优先队列
- hdu 1026 Ignatius and the Princess I 优先队列 + bfs
- HDU 1026 Ignatius and the Princess I (bfs+手写队列保存路径)
- 我爱崔老师系列之 BFS+优先队列+路径记录 HDU 1026 Ignatius and the Princess I(BFS)
- hdu 1026 Ignatius and the Princess I(简单的bfs+输出路径)(WA的代码)
- HDU1026——Ignatius and the Princess I(BFS)