zoj 1649 Rescue bfs
来源:互联网 发布:思维导图 mac版下载 编辑:程序博客网 时间:2024/05/16 09:59
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.)
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.
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
思路:找到她每一个朋友的位置,每个进行一次bfs,求出最小值即可。
代码:
#include <cstdio>#include <queue>#include <cstring>using namespace std;#define maxn 200+10struct Node{int x,y;int step;bool friend operator <(Node a,Node b){return a.step > b.step;}}start[maxn],stop;int dx[] = {0,0,-1,1};int dy[] = {1,-1,0,0};int n,m;char s[maxn][maxn];int ans;int cnt;bool bfs(int k){priority_queue<Node> que;bool v[maxn][maxn];memset(v,false,sizeof v);Node node;que.push(start[k]);v[start[k].x][start[k].y] = true;while(!que.empty()){node = que.top();que.pop();if(node.x==stop.x && node.y==stop.y){ans = node.step;return true;}for(int i=0;i<4;i++){int xx = node.x+dx[i], yy = node.y+dy[i];if(xx>=0 && xx<n && yy>=0 && yy<m && !v[xx][yy] && s[xx][yy]!='#'){Node temp = node;temp.x = xx, temp.y = yy;if(s[xx][yy]=='x') temp.step += 2;else temp.step++;que.push(temp);v[xx][yy] = true;}}}return false;}int main(){while(~scanf("%d %d\n",&n,&m)){cnt = 0;for(int i=0;i<n;i++){for(int j=0;j<m;j++){scanf("%c",&s[i][j]);if(s[i][j]=='r'){start[cnt].x = i;start[cnt].y = j;start[cnt++].step = 0;}if(s[i][j]=='a'){stop.x = i;stop.y = j;}}getchar();}bool flag = false;int res = 9999999;for(int i=0;i<cnt;i++){if(bfs(i)){flag = true;if(ans<res) res = ans;}}if(flag) printf("%d\n",res);else printf("Poor ANGEL has to stay in the prison all his life.\n");}return 0;}
- ZOJ 1649 Rescue (BFS)
- zoj 1649 rescue (bfs)
- ZOJ 1649 : Rescue - BFS
- zoj 1649 Rescue bfs
- ZOJ 1649 Rescue BFS水题
- ZOJ 1649 Rescue(BFS)
- ZOJ 1649 Rescue (BFS)
- ZOJ 1649:Rescue(BFS)
- zoj 1649 Rescue (bfs+队列)
- 简单BFS ZOJ 1649Rescue
- ZOJ 1649 Rescue(BFS)
- ZOJ 1649 Rescue (BFS) -- from lanshui_Yang
- ZOJ 1649 - Rescue BFS/优先队列
- ZOJ-1649 Rescue BFS (HDU 1242)
- ZOJ 1649 && HDU 1242 Rescue (BFS)
- ZOJ 1649 Rescue(有敌人迷宫BFS)
- ZOJ 1649 Rescue BFS (搜索)
- zoj 1649 Rescue【BFS+优先队列】
- 暑假集训第二周——递推 S - 棋盘游戏
- GridView、Repeater合并单元格
- CSS浮动属性
- uva 624 CD 01背包打印路径
- Android Studio创建项目
- zoj 1649 Rescue bfs
- WPF 基础到企业应用系列1——开篇有益
- 欢迎使用CSDN-markdown编辑器
- sysctl -P 报错解决办法
- Windows+eclipse+Android+java+api+opencv使用需要注意的几点
- java 构造函数与继承
- OSGi介绍
- C++中的数组指针与数组引用
- MongoDB常见错误总结