ZOJ Problem Set - 1649 Rescue
来源:互联网 发布:ubuntu分区revert 编辑:程序博客网 时间:2024/03/29 17:51
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
广度优先搜索题:
#include<iostream>#include<stdio.h>#include<string.h>#include<queue>#define MAX 200#define INF 100000using namespace std;struct Point{int r,c;int time;};char map[MAX][MAX];int mintime[MAX][MAX];int dir[4][2]={{0,-1},{-1,0},{0,1},{1,0}};int m,n;int dr,dc;int BFS(int r,int c){queue<Point> q;int time=INF;Point p1;p1.r=r;p1.c=c;p1.time=0;mintime[r][c]=0;q.push(p1);while(!q.empty()){Point tp=q.front();q.pop();for(int i=0;i<4;i++){///cout<<"mark #1"<<endl;int tr=tp.r+dir[i][0];int tc=tp.c+dir[i][1];//cout<<"tr: "<<tr<<" tc: "<<tc<<endl;if(tr>=0&&tr<m&&tc>=0&&tc<n&&map[tr][tc]!='#'){//cout<<"mark #2"<<endl;int tt=tp.time;tt++;if(map[tr][tc]=='x') tt++;Point tp2;tp2.r=tr;tp2.c=tc;tp2.time=tt;//cout<<"tt: "<<tt<<endl;//cout<<"mintime[tr][tc]: "<<mintime[tr][tc]<<endl;if(tt<mintime[tr][tc]){ mintime[tr][tc]=tt;q.push(tp2);}//cout<<"mark #3"<<endl;}}}return mintime[dr][dc];}int main(){while(cin>>m>>n){int sr,sc;for(int i=0;i<m;i++){for(int j=0;j<n;j++){mintime[i][j]=INF;cin>>map[i][j];char t=map[i][j];if(t=='r'){sr=i;sc=j;}if(t=='a'){dr=i;dc=j;}}}int result=BFS(sr,sc);if(result!=INF)cout<<result<<endl;else cout<<"Poor ANGEL has to stay in the prison all his life."<<endl;/*for(int i=0;i<m;i++){for(int j=0;j<n;j++){cout<<mintime[i][j]<<'\t';//cout<<map[i][j]<<' ';}cout<<endl;}*/}}
- ZOJ Problem Set - 1649 Rescue
- 龙哥牛b代码!ZOJ Problem Set - 1649 Rescue
- ZOJ Problem Set - 1649 Rescue BFS+优先队列
- ZOJ Problem Set - 1649
- ZOJ Problem Set - 2060
- ZOJ Problem Set - 2972
- ZOJ Problem Set - 1037
- ZOJ Problem Set - 1048
- ZOJ Problem Set - 1049
- ZOJ Problem Set - 1051
- ZOJ Problem Set - 1067
- ZOJ Problem Set - 1115
- ZOJ Problem Set - 1151
- ZOJ Problem Set - 1205
- ZOJ Problem Set - 1025
- ZOJ Problem Set - 1029
- ZOJ Problem Set - 1076
- ZOJ Problem Set - 1117
- SIFT特征提取分析
- 特征提取方法 SIFT,PCA-SIFT,GLOH,SURF
- SIFT特征提取-应用篇
- 06-html5游戏坦克大战第二战(小球移动)
- KMeans和KMedoid 的Matlab实现
- ZOJ Problem Set - 1649 Rescue
- hibernate中的SessionFactory,Session分别表示什么啊?如何理解?
- POJ 1141 Brackets Sequence
- 聚类算法K-Means, K-Medoids, GMM, Spectral clustering,Ncut
- EM算法原理
- 统计学习方法——CART, Bagging, Random Forest, Boosting
- 07-html5游戏坦克大战第三战(坦克移动)
- CXF ws client, dynamic endpoint and loading WSDL from the classpath
- 如何成为一名游戏设计师