HDU 1242 Rescue(优先队列+bfs)
来源:互联网 发布:amd多核cpu优化补丁 编辑:程序博客网 时间:2024/06/10 11:08
Rescue
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 20696 Accepted Submission(s): 7384
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
13ac代码:#include<stdio.h>#include<string.h>#include<queue>#include<iostream>#include<algorithm>using namespace std;int n,m;int ex,ey;char map[205][205];int v[205][205];int dir[4][2]={{1,0},{-1,0},{0,1},{0,-1}};struct s{int x;int y;int time;friend bool operator<(s n1,s n2)//优先队列,时间少的优先 { return n2.time<n1.time; } }a,b;int check(s w){if(w.x<0||w.x>=n||w.y<0||w.y>=m||v[w.x][w.y])return 1;if(map[w.x][w.y]=='#')return 1;return 0;}int bfs(int c,int d){priority_queue<s>q;//创建优先队列 int i;a.x=c;a.y=d;a.time=0;v[c][d]=1;q.push(a);while(!q.empty()){a=q.top();q.pop();if(a.x==ex&&a.y==ey){return a.time;}for(i=0;i<4;i++){b=a;b.x=b.x+dir[i][0];b.y=b.y+dir[i][1];if(check(b))continue;if(map[b.x][b.y]=='x')//记录时间 b.time=a.time+2;elseb.time=a.time+1;v[b.x][b.y]=1;//标记走过q.push(b);}}return 0;}int main(){int i,j;int bx,by;int sum;while(scanf("%d%d",&n,&m)!=EOF){memset(v,0,sizeof(v));for(i=0;i<n;i++){scanf("%s",map[i]);for(j=0;j<m;j++){if(map[i][j]=='r')//纪录起始和终点{bx=i;by=j;}if(map[i][j]=='a'){ex=i;ey=j;}}}sum=0;sum=bfs(bx,by);if(sum){ printf("%d\n",sum); }else{printf("Poor ANGEL has to stay in the prison all his life.\n");}}return 0;}
0 0
- hdu 1242Rescue(bfs+优先队列)
- hdu 1242 Rescue (优先队列+bfs)
- HDU 1242 Rescue(BFS +优先队列)
- hdu 1242 Rescue(bfs+优先队列)
- HDU 1242 Rescue 优先队列+BFS
- HDU 1242 Rescue(BFS,优先队列)
- HDU 1242 Rescue(BFS+优先队列)
- hdu-1242-Rescue(优先队列 BFS)
- HDU 1242 Rescue(优先队列 + 多源BFS)
- [ACM] hdu 1242 Rescue (BFS+优先队列)
- hdu 1242 Rescue(BFS优先队列)
- HDU 1242 Rescue (BFS+优先队列)
- hdu 1242 Rescue (bfs+优先队列)
- HDU 1242 Rescue (BFS+优先队列)
- HDU 1242 Rescue(优先队列+bfs)
- HDU 1242 Rescue【优先队列BFS】
- hdu 1242 Rescue(BFS+优先队列)
- hdu 1242 Rescue bfs+优先队列priority
- MatLab7安装方法
- Oracle SQL 总结
- Linux下多核CPU知识
- leetcode 054 —— Spiral Matrix
- 外地人
- HDU 1242 Rescue(优先队列+bfs)
- android图片处理之图像模糊
- HttpClient
- Cocos2d-x AnchorPoint锚点
- 初试结构体杭电1862EXCEL排序
- 【机房收费系统】时间控件的使用及显示当前电脑的名称
- HDU 5305 Friends (DFS)
- Thinking in Java 笔记(第二章 一切都是对象)
- mac下idea的常用快捷键