hdu1242 优先队列+bfs

Rescue

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 22034    Accepted Submission(s): 7843

Problem Description
Angel was caught by the MOLIGPY! He was put in * by Moligpy. The * is described as a N * M (N, M <= 200) matrix. There are WALLs, ROADs, and GUARDs in the *.

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 * all his life." 
 
Sample Input
7 8
#.#####.
#.a#..r.
#..#x...
..#..#.#
#...##..
.#......
........
 
Sample Output
13
 
Author
CHEN, Xue
 
Source
 
Recommend
Eddy   |   We have carefully selected several similar problems for you:  1240 1016 1010 1072 1241 
 #include <stdio.h>
#include <string.h>
#include <queue>
#include <algorithm>
using namespace std; struct Point
{
int x,y,t;
bool operator < (const Point &a)const
{
return t>a.t;
}
}; char map[][];
Point start;
int n,m;
int diect[][]={{,},{-,},{,},{,-}}; int bfs()
{
priority_queue<Point> que;
Point cur,next;
int i,j; map[start.x][start.y]='#';
que.push(start);
while(!que.empty())
{
cur=que.top();
que.pop();
for(i=;i<;i++)
{
next.x=cur.x+diect[i][];
next.y=cur.y+diect[i][];
next.t=cur.t+;
if(next.x< || next.x>=n || next.y< || next.y>=m)
continue;
if(map[next.x][next.y]=='#')
continue;
if(map[next.x][next.y]=='r')
return next.t;
if(map[next.x][next.y]=='.')
{
map[next.x][next.y]='#';
que.push(next);
}
else if(map[next.x][next.y]=='x')
{
map[next.x][next.y]='#';
next.t++;
que.push(next);
}
}
}
return -;
} int main()
{
int i,j,ans;
char *p;
while(scanf("%d %d",&n,&m)!=EOF)
{
for(i=;i<n;i++)
{
scanf("%s",map[i]);
if(p=strchr(map[i],'a'))
{
start.x=i;
start.y=p-map[i];
start.t=;
}
}
ans=bfs();
if(ans==-)
printf("Poor ANGEL has to stay in the * all his life.\n");
else
printf("%d\n",ans);
}
return ;
}
上一篇:Linux系统下安装Mysql


下一篇:发现IE7的一个问题,不能用索引取字符串中的单个字符