Oh, my goddess 时间限制：3000 ms | 内存限制：65535 KB 难度：3 描述 Shining Knight is the embodiment of justice an

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<queue>
#include<algorithm>
#include<cmath>
using namespace std;
char map[55][55];
int vis[55][55];
int dir[4][2]={{0,1},{1,0},{0,-1},{-1,0}};
int n,m;
int ex,ey;
struct dot
{
int x,y;
int step;
friend bool operator<(dot a,dot b)
{
return a.step>b.step;
}
};
int bfs(int x,int y)
{
dot a,b;
priority_queue<dot> all;
a.x=x;
a.y=y;
a.step=0;
all.push(a);
vis[a.x][a.y]=1;
while(!all.empty())
{
a=all.top();
all.pop();
if(a.x==ex&&a.y==ey)
return a.step;
for(int i=0;i<4;i++)
{
b.x=a.x+dir[i][0];
b.y=a.y+dir[i][1];
if(b.x<1||b.x>n||b.y<1||b.y>m||vis[b.x][b.y])
continue;
if(map[b.x][b.y]=='#')
b.step=a.step+4;
if(map[b.x][b.y]=='O')
b.step=a.step+1;
//cout<<"x="<<b.x<<",y="<<b.y<<",step="<<b.step<<endl;
all.push(b);
vis[b.x][b.y]=1;
}
}
return 0;
}
int main()
{
while(scanf("%d%d",&n,&m)!=EOF)
{
memset(vis,0,sizeof(vis));
for(int i=1;i<=n;i++)
{
getchar();
for(int j=1;j<=m;j++)
{
scanf("%c",&map[i][j]);
}
}
scanf("%d%d",&ex,&ey);
printf("%d\n",bfs(1,1));
}
return 0;
}