杭电1242 Rescue
来源:互联网 发布:晶振在单片机中的作用 编辑:程序博客网 时间:2024/05/22 08:25
Rescue
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 20846 Accepted Submission(s): 7446
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恩,题目大意就是说,a代表要救的人,r代表初始位置,#为墙,x为士兵,可以往四个方向走,每走一步花费一分钟然后遇到士兵并杀死士兵花费2分钟,问救到人最少花费多久时间。广搜,优先队列。#include<stdio.h>#include<string.h>#include<queue>#define INF 0x3f3f3f3fusing namespace std;struct node {int x,y,time;friend bool operator < (node a,node b){return a.time > b.time;}};int n,m;char map[220][220];int vis[220][220];int rec[220][220];int dir[4][2]={-1,0,1,0,0,-1,0,1};//int dir[4][2]={-1,0,0,-1,0,1,1,0};看讨论区里说这种方向不过,就试了一下,真的哎,过了呢 int judge(int x,int y){if(!vis[x][y]&&map[x][y]!='#'&&x>=0&&x<n&&y>=0&&y<m)return 1;return 0;}void bfs(int fx,int fy){node ss,now,next;ss.x=fx;ss.y=fy;ss.time=0;vis[fx][fy]=1;priority_queue<node>q;q.push(ss);while(!q.empty()){now=q.top();q.pop();if(map[now.x][now.y]=='a'){printf("%d\n",now.time);return ;}for(int i=0;i<4;++i){next.x=now.x+dir[i][0];next.y=now.y+dir[i][1];if(judge(next.x,next.y)){next.time=now.time+1;if(map[next.x][next.y]=='x')next.time++;vis[next.x][next.y]=1;//if(next.time>rec[next.x][next.y])//continue;//rec[next.x][next.y]=next.time;q.push(next);}}}printf("Poor ANGEL has to stay in the prison all his life.\n");}int main(){int fx,fy;while(~scanf("%d %d",&n,&m)){memset(map,0,sizeof(map));memset(vis,0,sizeof(vis));for(int i=0;i<n;++i)scanf("%s",map[i]);for(int i=0;i<n;++i){for(int j=0;j<n;++j){rec[i][j]=INF;if(map[i][j]=='r'){fx=i;fy=j;}}}bfs(fx,fy);}return 0;}
0 0
- 杭电1242---Rescue
- 杭电1242 rescue
- 杭电1242 Rescue
- 【杭电】[1242]Rescue
- 杭电 HDU 1242 Rescue
- hdu 杭电 1242 Rescue
- 杭电1242Rescue(bfs)
- 杭电 oj Rescue 1242
- 杭电1242-Rescue-DFS
- 杭电1242--Rescue--DFS 详解
- 杭电 1242 Rescue(广搜)
- 杭电1242Rescue(深搜)
- 【杭电oj1242】Rescue
- 【搜索之BFS + 优先队列】杭电 hdu 1242 Rescue
- 杭电1242--Rescue--BFS 广度优先算法详解
- 杭电1242Rescue题(bfs+优先队列)
- 杭电1242--Rescue(BFS+优先队列)
- Rescue HDU杭电1242【广搜+优先队列】
- js学习小总结
- LeetCode 12 Int2Roman && 13 Roman2Int
- 【转】iOS延迟加载
- JavaScript中==和===的区别
- 英语学习-7月收获的是一份坚持
- 杭电1242 Rescue
- 《显示数字时钟》
- Sikuli之批量卸载程序
- HDU 2111--Saving HDU【贪心水题】
- 关于java日期类Date,DateFormat,SimpleDateFormat,Calendar总结
- java常用容器(集合)的总结
- Bootstap学习的实用网站
- 深度测试Alpha混合方法Alpha测试
- OAuth的机制原理讲解及开发流程