HDOJ 1242 Rescue (BFS)
来源:互联网 发布:淘宝网上的衣服能买吗 编辑:程序博客网 时间:2024/05/02 21:32
Rescue
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 29544 Accepted Submission(s): 10405
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.)
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 <bits/stdc++.h>using namespace std;int n,m;int dir[4][2]= {{0,1},{0,-1},{1,0},{-1,0}};char mp[305][305];int num[305][305];typedef pair<int,int>Pair;int inbound(int x,int y){ return x>=0&&x<n&&y>=0&&y<m;}int bfs(int sx,int sy,int ex,int ey){ queue<Pair>q; while(!q.empty()) q.pop(); q.push(Pair(sx,sy)); num[sx][sy]=1; while(!q.empty()) { Pair step=q.front(); if(step.first==ex&&step.second==ey) return num[ex][ey]; for(int i=0; i<4; i++) { int nx=step.first+dir[i][0]; int ny=step.second+dir[i][1]; if(inbound(nx,ny)&&mp[nx][ny]!='#'&&!num[nx][ny]) { if(mp[nx][ny]=='.'||mp[nx][ny]=='a') { q.push(Pair(nx,ny)); num[nx][ny]=num[step.first][step.second]+1; } if(mp[nx][ny]=='x') { q.push(Pair(nx,ny)); num[nx][ny]=num[step.first][step.second]+2; } } } q.pop(); } return 0;}int main(){ while(~scanf("%d%d",&n,&m)) { memset(num,0,sizeof(num)); int x1,y1,x2,y2; for(int i=0; i<n; i++) scanf("%s",mp[i]); for(int i=0; i<n; i++) for(int j=0; j<m; j++) { if(mp[i][j]=='r') { x1=i; y1=j; } if(mp[i][j]=='a') { x2=i; y2=j; } } int flag=bfs(x1,y1,x2,y2); if(flag) printf("%d\n",flag-1); else printf("Poor ANGEL has to stay in the prison all his life.\n"); } return 0;}
- hdoj 1242 Rescue(bfs)
- hdoj 1242 Rescue (BFS)
- hdoj 1242 Rescue [BFS]
- HDOJ 1242 Rescue【BFS】
- hdoj 1242 Rescue 【bfs】
- HDOJ 1242 Rescue (BFS)
- HDOJ 1242 Rescue (BFS+优先队列)
- HDOJ 1242 Rescue 优先队列+bfs
- HDOJ 题目1242 Rescue(BFS)
- hdoj 1242 Rescue 【BFS + 优先队列】
- HDOJ 1242 Rescue(bfs+优先队列)
- hdoj 1242 Rescue (bfs+优先队列)
- HDOJ-1242(Rescue)(bfs+优先队列)
- hdoj 1242 Rescue (bfs 优先队列)
- HDOJ 1242 Rescue(BFS + 优先队列)
- HDOJ 1242 Rescue(优先队列+BFS)
- HDOJ 1242 Rescue (BFS + 优先队列)
- Hdoj 1424 Rescue 【BFS】
- 配置Linux定时任务
- C# 5.0 async 和 await
- Python中的Numpy、SciPy、MatPlotLib安装与配置
- Fragment的详解
- Web三个域对象的区别
- HDOJ 1242 Rescue (BFS)
- 3n+1问题
- 欢迎使用CSDN-markdown编辑器
- 安卓四大组件
- 0000
- 【实用】把jar转换成exe文件
- 关于OOM的
- Character
- servletConfig和servletContext