hdu 2612 Find a way(双起点bfs)

Find a way

#include<iostream>
#include<queue>
#include<cstring>
using namespace std;

typedef pair<int,int> PII;

int dx[4] = {0,-1,0,1}, dy[4] = {-1,0,1,0};

const int N = 205;
char g[N][N];
int d1[N][N],d2[N][N];
int n,m;

void bfs1(int xx,int yy)
{
    queue<PII> q;
    q.push({xx,yy});
    d1[xx][yy] = 0;
    
    while(q.size())
    {
        PII t = q.front();
        q.pop();
        
        for(int i=0; i<4; i++)
        {
            int a = t.first + dx[i], b = t.second + dy[i];
            
            if(a<0 || a>=n || b<0 || b>=m) continue;
            if(g[a][b] == '#') continue;
            if(d1[a][b] != 0) continue;
            
            d1[a][b] = d1[t.first][t.second] + 1;
            q.push({a,b});
        }
    }
}

void bfs2(int xx,int yy)
{
    queue<PII> q;
    q.push({xx,yy});
    d2[xx][yy] = 0;
    
    while(q.size())
    {
        PII t = q.front();
        q.pop();
        
        for(int i=0; i<4; i++)
        {
            int a = t.first + dx[i], b = t.second + dy[i];
            
            if(a<0 || a>=n || b<0 || b>=m) continue;
            if(g[a][b] == '#') continue;
            if(d2[a][b] != 0) continue;
            
            d2[a][b] = d2[t.first][t.second] + 1;
            q.push({a,b});
        }
    }
}

int main()
{
    while(cin >> n >> m)
    {
        memset(d1,0,sizeof d1);
        memset(d2,0,sizeof d2);
        
        for(int i=0; i<n; i++)
         for(int j=0; j<m; j++)
          cin >> g[i][j];
          
        for(int i=0; i<n; i++)
         for(int j=0; j<m; j++)
         {
             if(g[i][j]=='Y')
             bfs1(i,j);
             if(g[i][j]=='M')
             bfs2(i,j);
         }
         
        int Min = 0x3f3f3f3f; 
         
        for(int i=0; i<n; i++)
         for(int j=0; j<m; j++)
         {
             if(g[i][j]=='@' && d1[i][j] != 0 && d2[i][j] != 0)
             Min = min(Min,d1[i][j] + d2[i][j]);
         }
         
         cout << Min*11 <<endl;
    }
}