小A和小B

双向bfs

标程：

#pragma GCC optimize(3,"Ofast","inline")
#include<bits/stdc++.h>
#define pb push_back
#define Rep(i,a,b) for(int i=a;i<=b;i++)
using namespace std;
typedef long long ll;
typedef long double ld;
const int inf=0x3f3f3f3f;
const ll INF=9e18;
const int N=1e3+50;
char mp[N][N];
int n,m,cx,cy,gx,gy,step=0; 
struct node{ int x,y; };
queue<node> q[2];
int dx[]={0,0,1,-1,1,-1,1,-1};
int dy[]={-1,1,0,0,1,-1,-1,1};
bool vis[2][N][N];
int bfs(int w) {
    int sz=q[w].size();
    while(sz--) {
        node u=q[w].front();
        q[w].pop();
        int x=u.x,y=u.y;
        for(int i=0;i<4+(w==0?4:0);i++) {
            int nx=x+dx[i];
            int ny=y+dy[i];
            if(nx<1||nx>n||ny<1||ny>m||mp[nx][ny]=='#') continue;
            if(!vis[w][nx][ny]) {
                if(vis[w^1][nx][ny]) return 1;
                vis[w][nx][ny]=1;
                q[w].push({nx,ny});
            }
        }
    }
    return 0;
}
int solve() {
    q[0].push({cx,cy});
    q[1].push({gx,gy});
    vis[0][cx][cy]=vis[1][gx][gy]=1;
    step=0;
    while(!q[0].empty()||!q[1].empty()) {
        step++;
        if(bfs(0)) return step;
        if(bfs(1)) return step;
        if(bfs(1)) return step;
    }
    return -1;
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    cin>>n>>m;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++) {
            cin>>mp[i][j];
            if(mp[i][j]=='C') cx=i,cy=j;
            if(mp[i][j]=='D') gx=i,gy=j;
        }
    int ans=solve();
    if(ans!=-1) printf("YES\n%d\n",ans);
    else printf("NO\n");
    return 0;
}