题目链接:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=1649
源代码:
#include<iostream>
#include<string.h>
#include<queue>
#include<stdio.h>
using namespace std;
int m,n;
int x[4]={-1,0,1,0};
int y[4]={0,1,0,-1};
char map[205][205];
struct node
{
int x,y,step;
}s;
bool operator <(node m,node n)
{
return m.step>n.step;
}
int bfs()
{
priority_queue<node>q;/*优先队列*/ //自动排序
s.step=0;
q.push(s);
int i;
node p,t;
while(!q.empty())
{
p=q.top();
q.pop();
for(i=0;i<4;i++)
{
t.x=p.x+x[i];
t.y=p.y+y[i];
if(t.x<0||t.y<0||t.y>=n||t.x>=m) continue;
if(!(map[t.x][t.y]=='#'))
{
if(map[t.x][t.y]=='x')
{
t.step=p.step+2;
q.push(t);
map[t.x][t.y]='#';
}
else if(map[t.x][t.y]=='.')
{
t.step=p.step+1;
q.push(t);
map[t.x][t.y]='#';
}
else if(map[t.x][t.y]=='a')
{
return p.step+1;
}
}
}
}
return -1; //如果最终还是没找到,返回-1
}
int main()
{
int digit;
while(cin>>m>>n)
{
for(int i=0;i<m;i++)
cin>>map[i];
for(int i=0;i<m;i++)
{
for(int j=0;j<n;j++)
{
if(map[i][j]=='r')
{
s.x=i;
s.y=j;
}
}
}
digit=bfs();
if(digit==-1)
cout<<"Poor ANGEL has to stay in the prison all his life."<<endl;
else cout<<digit<<endl;
}
}