HDU 1242 Rescue
来源:互联网 发布:可视化数据设计 编辑:程序博客网 时间:2024/06/06 09:38
Rescue
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 21363 Accepted Submission(s): 7614
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
要注意DFS的写法。如果是采取记录整个图,每个格子所花的时间。会把问题复杂化。
其实只要记录所有搜到R的结果中的最小值。
#include <iostream>#include <cstdio>#include <cmath>#include <vector>#include <cstring>#include <algorithm>#include <string>#include <set>#include <functional>#include <numeric>#include <sstream>#include <stack>#include <map>#include <queue>using namespace std;#define ll long longstring g[200];ll st1,st2;long long n,m;bool visit[200][200] ;ll minx;void dfs(ll x1,ll y1,ll t){if(x1<0||x1>=n||y1<0||y1>=m)return;if(g[x1][y1]=='#')return;if(visit[x1][y1]==1)return;if(g[x1][y1]=='r'){if(t<minx)minx = t;return;}if(g[x1][y1]=='x')t++;visit[x1][y1] = 1;dfs(x1+1,y1,t+1);dfs(x1,y1+1,t+1);dfs(x1-1,y1,t+1);dfs(x1,y1-1,t+1);visit[x1][y1] = 0; }int main(){while(cin >> n >> m){minx = 220;memset(visit,0,sizeof(visit));for(int i=0;i<n;i++){cin >> g[i];for(int j = 0;j<m;j++){if(g[i][j]=='a'){st1 = i;st2 = j;}}}dfs(st1,st2,0);if(minx==220)cout<<"Poor ANGEL has to stay in the prison all his life."<<endl;elsecout<<minx<<endl;}return 0;}
0 0
- hdu 1242 Rescue
- HDU-1242-Rescue
- HDU 1242 Rescue
- HDU-1242 Rescue
- hdu 1242 Rescue
- hdu 1242 Rescue<java>
- hdu 1242 rescue
- HDU-1242:Rescue
- HDU 1242 Rescue
- HDU 1242 Rescue
- hdu 1242 Rescue
- hdu 1242 Rescue
- hdu 1242 Rescue
- hdu 1242 Rescue
- hdu 1242 Rescue
- Rescue hdu 1242
- hdu-1242-Rescue
- Hdu 1242 Rescue
- Java中Zip进行多文件保存
- 通过反汇编一个简单的C程序,分析汇编代码理解计算机是如何工作的(原创)
- Fiddler调试线上JS代码
- ios侧滑菜单使用经验
- 高精度运算
- HDU 1242 Rescue
- (七) Library Projects(库项目)
- windows下memcached的安装与使用
- android学习中
- VC从文件全路径中获取文件名和扩展名方法
- 如何抓微信的请求
- 最长递增子序列的长度
- hdu5353||2015多校联合第六场1001 贪心
- POJ 1320 Ones(普通的DP)