hdu1242 rescue【BFS】
来源:互联网 发布:国外留学 美食 知乎 编辑:程序博客网 时间:2024/05/31 19:08
Rescue
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 21259 Accepted Submission(s): 7586
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<stdio.h>#include<string.h>#include<queue>#include<iostream>using namespace std;#define INF 0xfffffffint m,n,x,y,ex,ey,ans,vis[220][220],flag;int dx[4]={0,0,-1,1};int dy[4]={-1,1,0,0};char map[220][220];struct node{int x,y,step;friend bool operator < (node a,node b){return a.step>b.step;}}a,temp;int jud(struct node a){if(a.x<0||a.x>=n) return 0;if(a.y<0||a.y>=m) return 0;if(vis[a.x][a.y]||map[a.x][a.y]=='#') return 0;if(temp.step>=ans) return 0;return 1; }void bfs(){flag=0;a.x=x;a.y=y;a.step=0;memset(vis,0,sizeof(vis));priority_queue<node>q;vis[x][y]=1;q.push(a);while(!q.empty()){a=q.top();q.pop();for(int i=0;i<4;i++) { temp.x=a.x+dx[i]; temp.y=a.y+dy[i]; temp.step=a.step+1; if(jud(temp)) { if(map[temp.x][temp.y]=='x') temp.step++; if(temp.x==ex&&temp.y==ey) { ans=temp.step; flag=1; return; } vis[temp.x][temp.y]=1; q.push(temp); } }}}int main(){int i,j;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]=='r') x=i,y=j; if(map[i][j]=='a') ex=i,ey=j; } if(x==ex&&y==ey) { printf("0\n"); continue;} ans=INF; bfs(); if(flag) printf("%d\n",ans); else printf("Poor ANGEL has to stay in the prison all his life.\n"); }return 0;}
0 0
- HDU1242 Rescue 【BFS】
- hdu1242 rescue【BFS】
- hdu1242 Rescue(BFS)
- HDU1242 Rescue(BFS松弛)
- hdu1242 Rescue--BFS
- hdu1242 Rescue bfs搜索
- BFS专题之hdu1242 rescue
- HDU1242:Rescue(BFS+优先队列)
- HDU1242 Rescue 解题报告--bfs
- hdu1242 Rescue 优先队列BFS
- HDU1242 Rescue-BFS,优先队列
- HDU1242:Rescue(BFS+优先队列)
- HDU1242 Rescue BFS+优先队列
- HDU1242 rescue 【BFS+优先队列】
- HDU1242:Rescue(BFS+优先队列)
- hdu1242 Rescue bfs+优先队列
- hdu1242 Rescue BFS+优先队列
- hdu1242 Rescue(BFS +优先队列 or BFS )
- hibernate 基础总结
- poj3301--Texas Trip(最小正方形覆盖)
- hdoj-- Walking Ant
- HDU-- 2015 Multi-University Training Contest 6 Cake
- 文件上传
- hdu1242 rescue【BFS】
- [Cocos2d-x] init()和onEnter()方法的区别(转)
- H.264码流SPS,PPS,IDR
- Auto Layout之创建布局约束
- jsCoverage
- 对A轮的追逐变得越加狂热,当前距离互联网泡沫究竟有多近?
- sql server删除重复的数据保留一行
- glOrtho,glFrustum,gluPerspective的理解,很清楚
- H264编码中的I帧,B帧,P帧