【YBTOJ】逃离噩梦

思路：

这道题要从男孩和女孩同时开始bfs，如果男孩走过女孩走过的点，那么就输出时间，女孩同理
当前格子能不能走只需要判断鬼的哈密顿距离是否能到达就行了
详见代码（其实就一个注释）

$code$

#include<iostream>
#include<cstring>
#include<cstdio>
#include<queue>
#include<cmath>
using namespace std;
int t;

struct node
{
	int x, y, s;
}; 

int n, m, g1x, g1y, g2x, g2y, flag;

char a[1000][1000];

queue<node> f, q;

int v[1000][1000];

int dx[4]={0, 1, 0, -1};
int dy[4]={1, 0, -1, 0};
inline int read() {
	int x=0, f=1; 
	char s=getchar();
	while (s<'0'||s>'9')
	{ 
		if(s=='-')
			f=-f; 
		s=getchar(); 
	}
	while(s>='0'&&s<='9')
	{
		x=x*10+s-'0';
		s=getchar();
    }
	return x*f;
}
bool check(int x, int y)
{
	if(x<1||x>n||y<1||y>m||a[x][y]=='X')
		return 0;
	return 1;
}
bool check1(int x, int y, int xx, int yy, int k)
{
	if(abs(x-xx)+abs(y-yy)<=2*k)
		return 0;
	return 1;
}
void bfs()
{
	memset(v, 0, sizeof(v));
	v[f.front().x][f.front().y]=1;
	v[q.front().x][q.front().y]=2;
	for(int k=1; !f.empty()||!q.empty(); k++)
	{
		for(int times=1; times<=3; times++)//走三次
		{
			for(int js=f.size(); js; js--)
			{
				int x=f.front().x, y=f.front().y;
			    f.pop();
				if(!check(x, y)||!check1(x, y, g2x, g2y, k)||!check1(x, y, g1x, g1y, k))
			    	continue;
			    for(int i=0; i<4; i++)
			    {
			    	int xx=x+dx[i], yy=y+dy[i];
			    	if(check(xx, yy)&&check1(xx, yy, g2x, g2y, k)&&check1(xx, yy, g1x, g1y, k)&&v[xx][yy]!=1)
			    	{
			    		f.push((node){xx, yy, k});
			    		if(v[xx][yy]==2)
			    		{
			    			printf("%d\n", k);
			    			return;
						}
						v[xx][yy]=1;
					}
				}
			}
		}
		for(int times=1; times<=1; times++)
		{
			for(int js=q.size(); js; js--)
			{
				int x=q.front().x, y=q.front().y;
			    q.pop();
				if(!check(x, y)||!check1(x, y, g2x, g2y, k)||!check1(x, y, g1x, g1y, k))
			    	continue;
			    for(int i=0; i<4; i++)
			    {
			    	int xx=x+dx[i], yy=y+dy[i];
			    	if(check(xx, yy)&&check1(xx, yy, g2x, g2y, k)&&check1(xx, yy, g1x, g1y, k)&&v[xx][yy]!=2)
			    	{
			    		q.push((node){xx, yy, k});
			    		if(v[xx][yy]==1)
			    		{
			    			printf("%d\n", k);
			    			return;
						}
						v[xx][yy]=2;
					}
				}
			}
		}
	}
	printf("-1\n");
}
int main()
{
	t=read();
	while(t--)
	{
		g1x=g2x=g1y=g2y=0;
		while(!f.empty())
			f.pop();
		while(!q.empty())
			q.pop();
		n=read();
		m=read();
		for(int i=1; i<=n; i++)
			for(int j=1; j<=m; j++)
			{
				a[i][j]=getchar();
				while(a[i][j]!='X'&&a[i][j]!='Z'&&a[i][j]!='.'&&a[i][j]!='M'&&a[i][j]!='G')
					a[i][j]=getchar();
				if(a[i][j]=='Z'&&g1x==0)
					g1x=i,g1y=j;
				else
				if(a[i][j]=='Z')
					g2x=i, g2y=j;
				if(a[i][j]=='M')
					f.push((node){i, j, 0});
				if(a[i][j]=='G')
					q.push((node){i, j, 0});
			}
        bfs();
	}
}