HDU 1026 Ignatius and the Princess I 广搜
2015-08-31 10:50
218 查看
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
Sample Output
Source
其实这个题真的真的没多难,只是队列换成了优先队列,血值小的先跳出罢了@。@
看另外一个题解把print函数写成了栈,其实跟递归一样嘛~这是看出了递归的优雅
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
Source
其实这个题真的真的没多难,只是队列换成了优先队列,血值小的先跳出罢了@。@
看另外一个题解把print函数写成了栈,其实跟递归一样嘛~这是看出了递归的优雅
#include <iostream> #include<cstring> #include<queue> #include<cstdio> using namespace std; struct node { int x,y,step; friend bool operator <(node a,node b) { return b.step<a.step;/// } }; int map[105][105]; int cnt[105][105]; int flag[105][105]; int to[4][2]={1,0,-1,0,0,1,0,-1}; int n,m,tim; int check(int x,int y) { if(x<0||x>=n||y<0||y>=m) return 1; if(map[x][y]==-1) return 1; return 0; } int bfs() { priority_queue<node> Q; node a,next; 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(int i=0;i<4;i++) { next=a; next.x+=to[i][0]; next.y+=to[i][1]; if(check(next.x,next.y)) continue; next.step=a.step+map[next.x][next.y]+1; map[next.x][next.y]=-1; flag[next.x][next.y]=i+1; Q.push(next); } } return 0; } void print(int x,int y) { int xx,yy; if(!flag[x][y]) return ; xx=x-to[flag[x][y]-1][0]; yy=y-to[flag[x][y]-1][1]; print(xx,yy); printf("%ds:(%d,%d)->(%d,%d)\n",tim++,xx,yy,x,y); while(cnt[x][y]--) printf("%ds:FIGHT AT (%d,%d)\n",tim++,x,y); } int main() { // freopen("cin.txt","r",stdin); while(~scanf("%d%d",&n,&m)) { memset(map,0,sizeof(map)); memset(flag,0,sizeof(flag)); memset(cnt,0,sizeof(cnt)); char s[105]; for(int i=0;i<n;i++) { scanf("%s",s); for(int j=0;s[j];j++) { if(s[j]=='X') map[i][j]=-1; else if(s[j]=='.') map[i][j]=0; 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"); } return 0; }
相关文章推荐
- 《JSF教程》-03 环境搭建与第一个入门例子
- 安卓工程不继承ActionBarActivity的设置
- 修改eclipse中web项目的server部署路径
- C++——编程常见错误
- C++——OOP面向对象理解
- 自动适应窗口大小
- Win7系统上面Tex live中利用fontspec包直接访问系统字体
- 大数的四则运算
- 整数划分问题(续)(非递归法)
- 安卓下载及入门教程记录
- Service和IntentService生命周期
- MySQL和SQLServer批量插入的SQL语句区别
- Android中级篇之百度地图SDK v3.5.0-基础地图[图解百度地图基础教程]
- HTML5读取本地文件
- ajax传form表单,表单里有table
- C&C++——段错误(Segmentation fault)
- java数组练习2创建二维数组,并将数组中的内容输出到控制台
- jQuery实现简单的列表式导航菜单效果代码
- android 代码中设置字体大小
- RabbitMQ消息队列(九):Publisher的消息确认机制