Nightmare Ⅱ Page123 双向BFS

Nightmare Ⅱ Page123 双向BFS

一开始错在写BFS的时候写了

while(!q.empty())
{
	...
	q.push(..);
}

这样写就相当于是从这个点一直搜索到任何可达点，错的很离谱

但是题意是让队列中的每一个位置移动一个位置
所以是让当前队列的所有数参与移动。故写成

c=q.size();
while(c--)
{
	...
	q.push(..);
}

另外，写法偏于复杂，不想优化写法了。

代码：

#pragma GCC optimize(1)
#pragma GCC optimize(2)
#pragma GCC optimize(3,"Ofast","inline")
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<string>
#include<vector>
#include<stack>
#include<bitset>
#include<cstdlib>
#include<cmath>
#include<set>
#include<list>
#include<deque>
#include<queue>
#include<map>
#define ll long long
#define ull unsigned long long
#define pb push_back
#define rep(x,a,b) for (int x=a;x<=b;x++)
#define repp(x,a,b) for (int x=a;x<b;x++)
#define W(x) printf("%d\n",x)
#define WW(x) printf("%lld\n",x)
#define pi 3.14159265358979323846
#define mem(a,x) memset(a,x,sizeof a)
#define lson rt<<1,l,mid
#define rson rt<<1|1,mid+1,r
using namespace std;
const int maxn=8e2+7;
const int INF=1e9;
const ll INFF=1e18;
char s[maxn][maxn];
int t,n,m,k,c;
int x[4]={0,0,1,-1};
int y[4]={1,-1,0,0};
struct node
{
    int x,y;
}tmp,M,G,Z1,Z2,pp;
bool vis[maxn][maxn][2];
queue<node> q1,q2;
bool bfs1()
{
    c=q1.size();
    while(c--)
    {
        node tmp=q1.front();
        q1.pop();
        if (abs(tmp.x-Z1.x)+abs(tmp.y-Z1.y)<=2*k)continue;
        if (abs(tmp.x-Z2.x)+abs(tmp.y-Z2.y)<=2*k)continue;
        rep(i,0,3)
        {
            pp.x=tmp.x+x[i];
            pp.y=tmp.y+y[i];
            if (pp.x>n||pp.x<=0||pp.y<=0||pp.y>m)continue;
            if (vis[pp.x][pp.y][0]||s[pp.x-1][pp.y-1]=='X')continue;
            if (abs(pp.x-Z1.x)+abs(pp.y-Z1.y)<=2*k)continue;
            if (abs(pp.x-Z2.x)+abs(pp.y-Z2.y)<=2*k)continue;
            vis[pp.x][pp.y][0]=true;
            if (vis[pp.x][pp.y][1])return true;
            q1.push(pp);
        }
    }
    return false;
}
bool bfs2()
{
    c=q2.size();
    while(c--)
    {
        node tmp=q2.front();
        q2.pop();
        if (abs(tmp.x-Z1.x)+abs(tmp.y-Z1.y)<=2*k)continue;
        if (abs(tmp.x-Z2.x)+abs(tmp.y-Z2.y)<=2*k)continue;
        rep(i,0,3)
        {
            pp.x=tmp.x+x[i];
            pp.y=tmp.y+y[i];
            if (pp.x>n||pp.x<=0||pp.y<=0||pp.y>m)continue;
            if (vis[pp.x][pp.y][1]||s[pp.x-1][pp.y-1]=='X')continue;
            if (abs(pp.x-Z1.x)+abs(pp.y-Z1.y)<=2*k)continue;
            if (abs(pp.x-Z2.x)+abs(pp.y-Z2.y)<=2*k)continue;
            vis[pp.x][pp.y][1]=true;
            if (vis[pp.x][pp.y][0])return true;
            q2.push(pp);
        }
    }
    return false;
}
int solve()
{
    mem(vis,false);
    while(!q1.empty())q1.pop();
    while(!q2.empty())q2.pop();
    q1.push(M);q2.push(G);
    vis[M.x][M.y][0]=true;
    vis[G.x][G.y][1]=true;
    k=0;
    while(!q1.empty()||!q2.empty())
    {
        k++;
        rep(i,0,2)if (bfs1())return k;
        if (bfs2())return k;
    }
    return -1;
}
int main()
{
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&n,&m);Z1.x=0,Z1.y=0;
        rep(i,0,n-1)scanf("%s",s[i]);
        rep(i,0,n-1)
        {
            rep(j,0,m-1)
            {
                if (s[i][j]=='M')
                {
                    M.x=i+1;M.y=j+1;
                }
                if (s[i][j]=='G')
                {
                    G.x=i+1;G.y=j+1;
                }
                if (s[i][j]=='Z'&&Z1.x==0)
                {
                    Z1.x=i+1;Z1.y=j+1;
                }
                if (s[i][j]=='Z')
                {
                    Z2.x=i+1;Z2.y=j+1;
                }
            }
        }
        W(solve());
    }
    return 0;
}