Rescue
来源:互联网 发布:知乎 李玮玲 编辑:程序博客网 时间:2024/05/09 14:31
题目描述
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.)
输入
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.
输出
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."
样例输入
7 8#.#####.#.a#..r.#..#x.....#..#.##...##...#..............
样例输出
13
#include<iostream>#include<cstdio>#include<cstring>#include<queue>using namespace std;char map[205][205];int n,m;int r[4][2]={{0,1},{0,-1},{1,0},{-1,0}};struct node{int x,y,s;bool operator < (const node&a) const{ return s>a.s;}};void bfs(int xx,int yy){priority_queue<node> q;struct node t1,t2,t3;t1.x=xx;t1.y=yy;t1.s=0;map[t1.x][t1.y]='#';q.push(t1);while(!q.empty()){t2=q.top();q.pop();for(int i=0;i<4;i++){t3.x=t2.x+r[i][0];t3.y=t2.y+r[i][1];if(t3.x>=0&&t3.x<n&&t3.y>=0&&t3.y<m&&map[t3.x][t3.y]!='#'){if(map[t3.x][t3.y]=='x') t3.s=t2.s+2;else t3.s=t2.s+1;if(map[t3.x][t3.y]=='r'){ printf("%d\n",t3.s); return;} map[t3.x][t3.y]='#';q.push(t3);}}}printf("Poor ANGEL has to stay in the prison all his life.\n");}int main(){while(cin >> n >> m){for(int i=0;i<n;i++){scanf("%s",map[i]);}int w1,w2;for(int i=0;i<n;i++){for(int j=0;j<m;j++){if(map[i][j]=='a'){ w1=i;w2=j;}}}bfs(w1,w2);}return 0;}
0 0
- Rescue
- Rescue
- Rescue
- Rescue
- Rescue
- Rescue
- Rescue
- Rescue
- Rescue
- Rescue
- Rescue
- Rescue
- Rescue
- Rescue
- Rescue
- Rescue
- Rescue
- Rescue
- BASIC-14时间转换取余 数字字符混合输出VIP试题
- 蜘蛛牌
- java计划任务调度框架quartz结合spring实现调度的配置实例代码分享
- 滤波
- 白话经典算法系列之六 快速排序 快速搞定(转)
- Rescue
- 如何将make编译之后的错误信息重定向到一个文件中
- 相册的操作
- SSH实现带进度条的Ajax文件上传
- cpp头文件相关
- Java的native方法
- POJ 2533 动态规划入门 (LIS)
- MAC升级导致brew出错
- 【计算机】hosts设置