HDOJ1026 优先队列
来源:互联网 发布:js怎么获取input的值 编辑:程序博客网 时间:2024/06/11 02:40
Ignatius and the Princess I
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 19737 Accepted Submission(s): 6422
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: 1240 1195 1372 1043 1254
这是我第一次写优先队列,发表个博客纪念一下。。
查bug查了好久。。
看来语法关还没过啊。。。。
#include <iostream>#include <cstdio>#include <cstring>#include <queue>using namespace std;const int maxn = 105;struct node{ int x,y,t; bool operator<(const node &f) const { return f.t<t; }};int i,j,k,n,m,tot,t,dir[maxn][maxn],fight[maxn][maxn];int dx[]= {1,-1,0,0};int dy[]= {0,0,1,-1};char MAP[maxn][maxn];bool used[maxn][maxn],flag;priority_queue<node>a;struct node p,q;void init(){ for (i=0; i<n; i++) { for (j=0; j<m; j++) cin >> MAP[i][j]; } while(!a.empty()) a.pop(); memset(dir,0,sizeof(dir)); memset(fight,0,sizeof(fight)); p.x=0; p.y=0; p.t=0; MAP[0][0]='X'; a.push(p);}bool check(int x ,int y){ if (x<0 || y<0 || x>=n || y>=m) return 0; if (MAP[x][y]=='X') return 0; return 1;}void output(int x,int y){ if (x==0 && y==0) { printf("It takes %d seconds to reach the target position, let me show you the way.\n",tot); return; } int prex = x-dx[dir[x][y]]; int prey = y-dy[dir[x][y]]; output(prex,prey); printf("%ds:(%d,%d)->(%d,%d)\n",t++,prex,prey,x,y); while (fight[x][y]--) { printf("%ds:FIGHT AT (%d,%d)\n",t++,x,y); }}void bfs(){ int tmpx,tmpy; while (!a.empty()) { p = a.top(); a.pop(); if (p.x==n-1 && p.y==m-1) { tot = p.t; t=1; output(p.x,p.y); flag=1; return; } for (i=0; i<4; i++) { q = p; q.x += dx[i]; q.y += dy[i]; q.t++; if (!check(q.x,q.y)) continue; if(MAP[q.x][q.y]!='.') { q.t+=MAP[q.x][q.y]-'0'; fight[q.x][q.y]=MAP[q.x][q.y]-'0'; } dir[q.x][q.y]=i; MAP[q.x][q.y]='X'; a.push(q); } }}int main(){ while (cin >> n >> m) { init(); flag=0; bfs(); if (!flag) printf("God please help our poor hero.\n"); printf("FINISH\n"); } return 0;}
- HDOJ1026 优先队列bfs
- HDOJ1026 优先队列
- HDOJ1026
- hdoj1026
- 优先队列
- 优先队列
- 优先队列
- 优先队列
- 优先队列
- 优先队列
- 优先队列
- 优先队列
- 优先队列
- 优先队列
- 优先队列
- 优先队列
- 优先队列
- 优先队列
- jquery表情 juqery qq表情适用jQuery QQ表情插件jquery.qqFace
- Apache Kafka:下一代分布式消息系统
- Sublime Text的优雅使用
- Android开发初体验之百度地图开发(2)
- Android NDK学习笔记3-入门案例篇
- HDOJ1026 优先队列
- Flume 监控
- 移动web开发之四轮播图
- 001-在HTML中嵌入JavaScript脚本的三种方式-回顾学习
- 转:C#实现office文档转换为PDF或xps的一些方法
- 机器学习算法Newton Sketch
- Atitit 经济学常见的流派 古典主义与凯恩斯主义
- CI 漂亮的分页样式(页码样式)
- Day11-36.Controlling Execution