HDOJ 1242 Rescue(优先队列+BFS)
来源:互联网 发布:asp.net与php的区别 编辑:程序博客网 时间:2024/05/21 16:56
Rescue
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 26404 Accepted Submission(s): 9334
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
不开这个标记数组vis就过了,不然,超内存;
本题用优先队列,保证每次走的步数都是最小的,所以才有最后的最小步数;
代码:
#include<stdio.h>#include<string.h>#include<queue>#include<algorithm>using namespace std;int n,m,sx,sy,ex,ey;char map[250][250];//bool vis[250][250];int dx[4]={0,0,-1,1};int dy[4]={-1,1,0,0};struct node{int x,y,step;bool friend operator<(node a,node b){return a.step>b.step;}}a;bool check(node end){if(end.x>=0&&end.x<n&&end.y>=0&&end.y<m&&map[end.x][end.y]!='#') return 1;else return 0;}int bfs(){priority_queue<node>q;node now,end;a.x=sx,a.y=sy,a.step=0;map[sx][sy]='#';q.push(a);while(!q.empty()){now=q.top();q.pop();if(now.x==ex&&now.y==ey){return now.step;}for(int i=0;i<4;i++){ end.x=now.x+dx[i];end.y=now.y+dy[i];if(check(end)){if(map[end.x][end.y]=='.'||map[end.x][end.y]=='a') end.step=now.step+1;else end.step=now.step+2;map[end.x][end.y]='#';q.push(end);}}}return -1;}int main(){while(scanf("%d%d",&n,&m)!=EOF){//memset(vis,0,sizeof(vis));for(int i=0;i<n;i++){scanf("%s",map[i]);for(int j=0;j<m;j++){if(map[i][j]=='a'){ex=i;ey=j;}if(map[i][j]=='r'){sx=i;sy=j;}}}int ans=bfs();if(ans==-1) printf("Poor ANGEL has to stay in the prison all his life.\n");else printf("%d\n",ans);}return 0;}
0 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/HDU 1242 Rescue(经典BFS深搜-优先队列)
- hdu 1242Rescue(bfs+优先队列)
- hdu 1242 Rescue (优先队列+bfs)
- HDU 1242 Rescue(BFS +优先队列)
- hdu 1242 Rescue(bfs+优先队列)
- 1242Rescue (优先队列BFS)
- HDU 1242 Rescue 优先队列+BFS
- HDU 1242 Rescue(BFS,优先队列)
- DSP移植-全局阈值分割
- 搜索引擎选择: Elasticsearch与Solr
- ACM HDU 1263水果
- Linux_Linux命令_wc_统计命令_Word Count
- 声明JavaScript函数的六种方法
- HDOJ 1242 Rescue(优先队列+BFS)
- 扩展欧几里得原理与模板
- Gaussian Blurring
- H.264中整数DCT变换,量化,反量化,反DCT究竟是如何实现的?(无代码,无真相)
- 关于main(int argc, char* argv[])
- 新浪SAE启动报class org.springframework.web.filter.CharacterEncodingFilter is not a javax.servlet.Filter
- Selenium - (new Actions(driver)).moveToElement(ele).click().perform() 页面没反应
- 杭电ACM 1280 前m大的数
- linux操作系统centos 7 安装MySQL数据库