HDOJ 1242 Rescue
来源:互联网 发布:淘宝与京东 编辑:程序博客网 时间:2024/06/07 01:57
Rescue
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 22897 Accepted Submission(s): 8103
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
bfs+优先队列!折腾了将近三个小时终于差不多能把这道题写出来了。
代码如下:
#include<cstdio>#include<queue>using namespace std;int N,M,a_x,a_y,r_x,r_y;char Map[250][250];int dis[4][2]={{-1,0},{1,0},{0,-1},{0,1}};struct Note{int x,y,step;bool friend operator<(Note x,Note y){return x.step>y.step;}}r,temp;int Judge(Note a){if(a.x>=0&&a.x<N&&a.y>=0&&a.y<M&&Map[a.x][a.y]!='#')return 1;elsereturn 0;}int bfs(){priority_queue<Note>q;int i;r.x=r_x;r.y=r_y;r.step=0;q.push(r);while(!q.empty()){r=q.top();q.pop();if(r.x==a_x&&r.y==a_y)return r.step;for(i=0;i<4;i++){temp.x=r.x+dis[i][0];temp.y=r.y+dis[i][1];if(Judge(temp)){if(Map[temp.x][temp.y]=='.'||Map[temp.x][temp.y]=='a')temp.step=r.step+1;elsetemp.step=r.step+2;Map[temp.x][temp.y]='#';q.push(temp);}}}return -1;}int main(){while(~scanf("%d%d",&N,&M)){for(int i=0;i<N;i++){scanf("%s",Map[i]);for(int j=0;j<M;j++){if(Map[i][j]=='r'){r_x=i;r_y=j;}if(Map[i][j]=='a'){a_x=i;a_y=j;}}}int time=bfs();if(time==-1)printf("Poor ANGEL has to stay in the prison all his life.\n");elseprintf("%d\n",time);}return 0;}
0 0
- hdoj 1242 Rescue(bfs)
- hdoj 1242 Rescue
- hdoj 1242 Rescue
- hdoj-1242-Rescue(DFS)
- HDOJ 1242 Rescue
- hdoj 1242 Rescue (BFS)
- 【hdoj 1242】Rescue
- HDOJ--1242--Rescue
- hdoj 1242 Rescue
- hdoj 1242 Rescue
- hdoj 1242 Rescue [BFS]
- HDOJ-1242-Rescue
- HDOJ 1242 Rescue【BFS】
- hdoj 1242 Rescue
- hdoj 1242 Rescue 【bfs】
- HDOJ 1242 Rescue
- hdoj 1242Rescue
- HDOJ-1242 Rescue
- 浅析JavaScript原型链与原型链式继承
- Android-在浏览器启动Activity
- example datasets in sklearn
- NSRange类详解
- 安卓进程通讯之aidl
- HDOJ 1242 Rescue
- Simple Java—Strings and Arrays(一)String是引用传值吗?
- zzulioj--1638--Happy Thanksgiving Day - Say 3Q I(水题)
- ROS naviagtion analysis: costmap_2d--ObstacleLayer
- 自己编写栈和队列的声明和调用
- CodeForces 611C New Year and Domino【预处理】
- Java使用RSA加密解密签名及校验
- [消息传递之七]-KVO练习
- 2016-01-10 FFC