全RE求助

#include<bits/stdc++.h>
#define pb push_back
using namespace std;
const int maxn=1e3+5;
int n,m,vis[maxn][maxn];
int dx[4]={0,0,-1,1};
int dy[4]={1,-1,0,0};
int ddx[8]={0,0,1,1,1,-1,-1,-1};
int ddy[8]={1,-1,-1,0,1,-1,0,1};
vector<int>dis[int(1e5)];
string s[maxn];
struct node{
	int x,y;
};
queue<node>q;
void bfs(int x,int y){
	for(int i=1;i<=n;++i)
		for(int j=1;j<=m;++j)
			dis[i][j]=int(1e9);
	dis[x][y]=0;
	while(!q.empty()){
		node a=q.front();
		q.pop();
		for(int i=0;i<4;++i){
			int nx=dx[i]+a.x,ny=dy[i]+a.y;
			if(nx>=1&&nx<=n&&ny>=1&&ny<=m&&vis[nx][ny]==0&&s[nx][ny]!='X'){
				q.push({nx,ny});
				vis[nx][ny]=vis[a.x][a.y]+1;
			}
		}
	}
}
bool nice(int a,int b);
int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin>>n>>m;
	for(int i=1;i<=n;++i)
		for(int j=1;j<=m;++j)
			cin>>s[i][j];
	while(1){
		int u,v,x,y;
		cin>>u>>v>>x>>y;
		if(u==0&&v==0&&x==0&&y==0)	break;
		int ans=dis[u-1][v-1];
		for(int i=0;i<8;++i){
			int a=u-1,b=v-1;
			while(nice(a+ddx[i],b+ddy[i])){
				a+=ddx[i];
				b+=ddy[i];
				ans=min(ans,dis[a][b]);
			}
			if(ans==int(1e9))	cout<<"Poor Harry";
			else	cout<<ans<<'\n';
		}
		vis[x][y]=1;
		q.push({x,y});
		bfs(x,y);
		vis[x][y]=0;
	}
	return 0;
}
bool nice(int a,int b){
	return a>0&&a<=n&&b>0&&b<=m&&s[a][b]!='X';
}