HDU1242-Rescue
来源:互联网 发布:淘宝店铺营销推广方式 编辑:程序博客网 时间:2024/06/03 12:35
Rescue
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Othe)
Total Submission(s): 24663 Accepted Submission(s): 8706
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
#include<iostream> #include<cstdio> #include<cstring> #include<cstdlib> #include<queue>using namespace std; char map[205][205]; int visit[205][205]; int dir[4][2]={{-1,0},{1,0},{0,-1},{0,1}}; int n,m; struct node { int x,y; int time; friend bool operator < (const node &a,const node &b) { return a.time>b.time; } }; int go(int x,int y) { if(0<=x&&x<n&&0<=y&&y<m&&map[x][y]!='#') return 1; return 0; } int bfs(int x,int y) { int i; node st,ed; priority_queue<node>que; memset(visit,0,sizeof(visit)); st.x=x; st.y=y; st.time=0; visit[st.x][st.y]=1; que.push(st); while(!que.empty()) { st=que.top(); que.pop(); if(map[st.x][st.y]=='r') return st.time; for(i=0;i<4;i++) { ed.x=st.x+dir[i][0]; ed.y=st.y+dir[i][1]; if(go(ed.x,ed.y)&&!visit[ed.x][ed.y]) { visit[ed.x][ed.y]=1; if(map[ed.x][ed.y]=='x') ed.time=st.time+2; else ed.time=st.time+1; que.push(ed); } } } return -1; } int main() { int i,j; int x,y,ans; while(scanf("%d%d",&n,&m)!=EOF) { for(i=0;i<n;i++) scanf("%s",map[i]); for(i=0;i<n;i++) { for(j=0;j<m;j++) { if(map[i][j]=='a') { x=i; y=j; break; } } } ans=bfs(x,y); if(ans==-1) printf("Poor ANGEL has to stay in the prison all his life.\n"); else printf("%d\n",ans); } return 0; }
0 0
- hdu1242 rescue
- hdu1242 Rescue
- hdu1242 Rescue
- HDU1242 Rescue
- hdu1242 Rescue
- HDU1242 Rescue
- HDU1242-Rescue
- HDU1242-Rescue
- HDU1242 Rescue
- (HDU1242)Rescue
- Rescue (hdu1242)
- HDU1242 Rescue 【BFS】
- hdu1242——Rescue
- hdu1242 rescue【BFS】
- hdu1242(Rescue)
- hdu1242 Rescue(BFS)
- HDU1242 Rescue(BFS松弛)
- H - Rescue hdu1242
- 数据库的备份与还原(vb.net代码篇)
- STL——vector和map
- 自己对Handler的一些理解
- windows系统下自定义图标
- leetcode——131——Palindrome Partitioning
- HDU1242-Rescue
- java二维数组
- linux mysql配置
- 最小生成树-prime算法
- 陌上花开缓缓归
- HDU 1236 强连通分量
- hdu 3068 最长回文 Manacher算法
- HDU1045&&ZOJ1002-Fire Net
- 在装有Nvidia独显的台式机上安装Ubuntu 14.04 TLS