杭电1242Rescue(深搜)
来源:互联网 发布:apache ab压力测试 编辑:程序博客网 时间:2024/05/29 19:08
Rescue
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 22277 Accepted Submission(s): 7914
Problem Description
Angel was caught by the MOLIGPY! He was put in prison by Moligpy. The prison is described as a N * M (N, M <= 200) matrix. There are WALLs, ROADs, and GUARDs in the prison.
Angel's friends want to save Angel. Their task is: approach Angel. We assume that "approach Angel" is to get to the position where Angel stays. When there's a guard in the grid, we must kill him (or her?) to move into the grid. We assume that we moving up, down, right, left takes us 1 unit time, and killing a guard takes 1 unit time, too. And we are strong enough to kill all the guards.
You have to calculate the minimal time to approach Angel. (We can move only UP, DOWN, LEFT and RIGHT, to the neighbor grid within bound, of course.)
Angel's friends want to save Angel. Their task is: approach Angel. We assume that "approach Angel" is to get to the position where Angel stays. When there's a guard in the grid, we must kill him (or her?) to move into the grid. We assume that we moving up, down, right, left takes us 1 unit time, and killing a guard takes 1 unit time, too. And we are strong enough to kill all the guards.
You have to calculate the minimal time to approach Angel. (We can move only UP, DOWN, LEFT and RIGHT, to the neighbor grid within bound, of course.)
Input
First line contains two integers stand for N and M.
Then N lines follows, every line has M characters. "." stands for road, "a" stands for Angel, and "r" stands for each of Angel's friend.
Process to the end of the file.
Then N lines follows, every line has M characters. "." stands for road, "a" stands for Angel, and "r" stands for each of Angel's friend.
Process to the end of the file.
Output
For each test case, your program should output a single integer, standing for the minimal time needed. If such a number does no exist, you should output a line containing "Poor ANGEL has to stay in the prison all his life."
Sample Input
7 8#.#####.#.a#..r.#..#x.....#..#.##...##...#..............
Sample Output
13
Author
CHEN, Xue
Source
ZOJ Monthly, October 2003
Recommend
Eddy | We have carefully selected several similar problems for you: 1240 1010 1072 1253 1372
本应该是一个广搜+优先队列的好题,但是我不大会广搜,就用深搜过了,倒着想就行了,从天使开始找,找他的朋友。
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;char map[220][220];int i,j,k,l,m,n,num,best;void dfs(int x,int y){if(map[x][y]=='#')return ;if(x<0||x>m||y<0||y>n)return ;if(map[x][y]=='a'){dfs(x,y+1);dfs(x,y-1);dfs(x+1,y);dfs(x-1,y);}if(map[x][y]=='x'){num++;num++;map[x][y]='#';dfs(x,y+1);dfs(x,y-1);dfs(x+1,y);dfs(x-1,y);map[x][y]='x';num--;num--;}if(map[x][y]=='r'){if(best>num)best=num;}if(map[x][y]=='.'){num++;map[x][y]='#';dfs(x,y+1);dfs(x,y-1);dfs(x+1,y);dfs(x-1,y);map[x][y]='.';num--;}}int main(){while(scanf("%d%d",&m,&n)!=EOF){for(i=0;i<m;i++)scanf("%s",map[i]);best=99999;for(i=0;i<m;i++)for(j=0;j<n;j++){num=0;if(map[i][j]=='a')dfs(i,j);}if(best!=99999)printf("%d\n",best+1);elseprintf("Poor ANGEL has to stay in the prison all his life.\n");}return 0;}
0 0
- 杭电1242Rescue(深搜)
- 杭电1242---Rescue
- 杭电1242 rescue
- 杭电1242 Rescue
- 【杭电】[1242]Rescue
- 杭电 1242 Rescue(广搜)
- 杭电 HDU 1242 Rescue
- hdu 杭电 1242 Rescue
- 杭电1242Rescue(bfs)
- 杭电 oj Rescue 1242
- 杭电1242-Rescue-DFS
- 杭电1242--Rescue(BFS+优先队列)
- 杭电1242-Rescue(bfs+优先队列||队列)
- 【杭电oj】1242-Rescue(bfs,优先队列)
- 杭电-1242 Rescue(优先队列+广搜)
- 杭电1242--Rescue--DFS 详解
- 【杭电oj1242】Rescue
- 【搜索之BFS + 优先队列】杭电 hdu 1242 Rescue
- 关于用代码实现控件间布局的问题
- VS2010 LNK1123: 转换到 COFF 期间失败: 文件无效或损坏 的解决方法
- Runtime那点事(消息机制一)
- 极客学院-PHP003-部署 PHP 代码[3_28]
- iOS开发通过代码方式使用AutoLayout (NSLayoutConstraint + Masonry)
- 杭电1242Rescue(深搜)
- 千古难题:设计优先or功能优先
- 通过预设物体Transform获取N层子对象的方法
- Linux网络编程——UDP通信(文件传输)
- scala的环境变量设置
- 树的先序、中序和后序遍历方式
- goke开发板 通过NFS挂载虚拟机目录/opt/goke/rootfs_uClibc为根文件系统
- C# NSoup.dll 抓取网页信息
- IOS动画Core Animation详解