atcode 339 D - Synchronized Players

题目链接

bfs : 四维 时间复杂度O(n^4); n<=60;

#include<bits/stdc++.h>
using namespace std;
const int N = 65;
int n;
char s[N][N];
int st[N][N][N][N];
int dist[N][N][N][N];
struct p{
    int a,b,c,d;
};
int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};
int res=1e9;
void bfs(int x1,int y1,int x2,int y2)
{
    queue<p>qu;
    qu.push({x1,y1,x2,y2});
    st[x1][y1][x2][y2]=1;
    dist[x1][y1][x2][y2]=0;
    while(qu.size())
    {
        auto t=qu.front(); qu.pop();
        for(int i=0;i<4;i++)
        {
            int a=dx[i]+t.a,b=dy[i]+t.b,c=dx[i]+t.c,d=dy[i]+t.d;
            if(s[a][b]=='#'||a>n||a<1||b>n||b<1) a=t.a,b=t.b;
            if(s[c][d]=='#'||c>n||c<1||d>n||d<1) c=t.c,d=t.d;
            if(st[a][b][c][d]) continue;
            st[a][b][c][d]=1;
            dist[a][b][c][d]=min(dist[a][b][c][d],dist[t.a][t.b][t.c][t.d]+1);
            qu.push({a,b,c,d});
            if(a==c&&b==d) res=min(res,dist[a][b][c][d]);
            
        }
    }
}
int main()
{
    memset(dist,0x3f,sizeof dist);
    cin>>n; int x[2],y[2],k=0;
    for(int i=1;i<=n;i++) for(int j=1;j<=n;j++)
    {
        cin>>s[i][j];
        if(s[i][j]=='P')    x[k]=i,y[k++]=j;
        
    }

    bfs(x[0],y[0],x[1],y[1]);
    if(res==1e9) cout<<-1;
    else
    cout<<res;
}