HDU 1026 Ignatius and the Princess I(广搜+路径记录+优先队列)
来源:互联网 发布:淘宝卖家店铺名称 编辑:程序博客网 时间:2024/05/11 16:17
Ignatius and the Princess I
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14680 Accepted Submission(s): 4654
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.XXXXX15 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)FINISHIt 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)FINISHGod please help our poor hero.FINISH//要队列优先 因为每个点并不是1 所以wa了 //我的第一次这种做法是为了记录路径 用STL队列保存路径感觉好麻烦 //改进后AC 用数组加快排模拟优先队列 #include <iostream>#include <cstdio>#include <string>#include <string.h>#include <algorithm>using namespace std;const int N=100+5;int map[N][N];int n,m,goal;bool ok;int route[N*N];bool book[N][N];struct Node{int x,y;int last;int step;}node,tmp;Node q[N*N];int step[4][2]={{0,1},{1,0},{-1,0},{0,-1}};bool cmp(Node a,Node b){return a.step<=b.step;}int main(){int i,j,head,tail;char c[N];while(scanf("%d%d",&n,&m)==2){head=0;tail=0;ok=0;for(i=0;i<n;i++){scanf("%s",c);for(j=0;j<m;j++){book[i][j]=0; if(c[j]=='.') map[i][j]=1; else if(c[j]>='1'&&c[j]<='9') map[i][j]=c[j]-'0'+1; else map[i][j]=-1;} }book[0][0]=1;node.last=0;node.x=0;node.y=0;node.step=0;q[tail++]=node;while(head<tail){sort(q+head,q+tail,cmp);tmp=q[head];if(tmp.x==n-1&&tmp.y==m-1) { ok=1; goal=head; }for(i=0;i<4;i++){ int a=tmp.x+step[i][0]; int b=tmp.y+step[i][1]; if(a<0||a>=n||b<0||b>=m||map[a][b]==-1||book[a][b]==1) continue; book[a][b]=1; node.x=a; node.y=b; node.last=head; node.step=tmp.step+map[a][b]; q[tail++]=node;}// book[tmp.x][tmp.y]=0;head++; } if(ok) {printf("It takes %d seconds to reach the target position, let me show you the way.\n",q[goal].step); i=0,j=goal; while(j!=0){ //处理路径 route[i++]=j; j=q[j].last; } route[i]=0; //路径最开始是head=0 for(j=1;i>=0;i--,j++){int a=q[route[i]].x;int b=q[route[i]].y;if(map[a][b]>1){while(map[a][b]>1){ printf("%ds:FIGHT AT (%d,%d)\n",j,a,b); j++; map[a][b]--;}}if(i>0)printf("%ds:(%d,%d)->(%d,%d)\n",j,a,b,q[route[i-1]].x,q[route[i-1]].y); } } else printf("God please help our poor hero.\n"); printf("FINISH\n");}return 0;}
0 0
- hdu 1026 Ignatius and the Princess I 广搜+优先队列+记录路径
- HDU 1026 Ignatius and the Princess I(广搜+路径记录+优先队列)
- hdu 1026 Ignatius and the Princess I(广搜+优先队列+路径保存)
- HDU-1026 Ignatius and the Princess I(广搜+优先队列+输出路径)
- hdu 1026 Ignatius and the Princess I(广搜+优先队列)
- HDU 1026 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 优先队列+路径记录
- HDU 1026 Ignatius and the Princess I (bfs + 优先队列 + 路径记录)
- HDU 1026 Ignatius and the Princess I 记录 路径广搜
- HDU 1026 Ignatius and the Princess I(广搜记录路径)
- hdu1026 Ignatius and the Princess I(广搜+记录路径)
- HDU--杭电--1026--Ignatius and the Princess I--广搜--直接暴力0MS,优先队列的一边站
- HDUOJ-1026 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 + 优先队列
- UIImagePickerController拍照与摄像
- itertools模块
- 关于get请求的缓存问题
- [Linux]查看启动信息方法
- 逆袭之路,我是PHP程序员(二) 路在何方
- HDU 1026 Ignatius and the Princess I(广搜+路径记录+优先队列)
- 在Amazon EC2 Linux主机上保障SSH安全
- 动态规划 美观程度(mg)
- 下载matlab2014a的安装程序
- 性能测试重现Session引发的OOM
- Note For Linux By Jes(15)-系统配置工具(网络与打印机)与硬件侦测
- S3C2440 LCD驱动(FrameBuffer)实例开发<一>
- 8.8.2 EXPLAIN Output Format
- MPLAB PICKIT3、MPLAB SIM调试