HDU 2612 Find a way【bfs】

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=2612

从Y和M分别bfs到每个KFC最短的路程，然后对每个KFC比较，找到Y和M距离和最短的。
这题一开始错误的思路方向是从KFC向Y和M找，显然KFC比较多，bfs的次数太多会超时。

#include<iostream>
#include<cstdio>
using namespace std;
int n,m,mi,sum;
char a[210][210];
int qx[40010],qy[40010],step[40010];
int kfc1[210][210],kfc2[210][210];
bool used[201][210];
void bfs1(int X,int Y)
{
    int i,j,l,r,x,y;
    for(i=1;i<=n;i++)
        for(j=1;j<=m;j++)
            used[i][j]=false;
    for(i=1;i<=n;i++)
        for(j=1;j<=m;j++)
        if(a[i][j]=='@')
        kfc1[i][j]=m*n+1;
    l=r=1;qx[1]=X;qy[1]=Y;
    used[X][Y]=true;step[1]=0;
    while(l<=r)
    {
        x=qx[l];y=qy[l];
//-----------------------------------------------------------------------------------------------
        if(y-1>=1&&!used[x][y-1]&&a[x][y-1]!='#'&&a[x][y-1]!='Y'&&a[x][y-1]!='M')
        {
            r++;qx[r]=x;qy[r]=y-1;
            used[x][y-1]=true;step[r]=step[l]+1;
            if(a[x][y-1]=='@') kfc1[x][y-1]=step[r];
        }
//------------------------------------------------------------------------------------------------
        if(y+1<=m&&!used[x][y+1]&&a[x][y+1]!='#'&&a[x][y+1]!='Y'&&a[x][y+1]!='M')
        {
            r++;qx[r]=x;qy[r]=y+1;
            used[x][y+1]=true;step[r]=step[l]+1;
            if(a[x][y+1]=='@') kfc1[x][y+1]=step[r];
        }
//--------------------------------------------------------------------------------------------------
        if(x-1>=1&&!used[x-1][y]&&a[x-1][y]!='#'&&a[x-1][y]!='Y'&&a[x-1][y]!='M')
        {
            r++;qx[r]=x-1;qy[r]=y;
            used[x-1][y]=true;step[r]=step[l]+1;
            if(a[x-1][y]=='@') kfc1[x-1][y]=step[r];
        }
//----------------------------------------------------------------------------------------------------
        if(x+1<=n&&!used[x+1][y]&&a[x+1][y]!='#'&&a[x+1][y]!='Y'&&a[x+1][y]!='M')
        {
            r++;qx[r]=x+1;qy[r]=y;
            used[x+1][y]=true;step[r]=step[l]+1;
            if(a[x+1][y]=='@') kfc1[x+1][y]=step[r];
        }
//-------------------------------------------------------------------------------------------------
    l++;
    }
}
void bfs2(int X,int Y)
{
    int i,j,l,r,x,y;
    for(i=1;i<=n;i++)
        for(j=1;j<=m;j++)
            used[i][j]=false;
    for(i=1;i<=n;i++)
        for(j=1;j<=m;j++)
        if(a[i][j]=='@')
        kfc2[i][j]=m*n+1;
    l=r=1;qx[1]=X;qy[1]=Y;
    used[X][Y]=true;step[1]=0;
    while(l<=r)
    {
        x=qx[l];y=qy[l];
//-----------------------------------------------------------------------------------------------
        if(y-1>=1&&!used[x][y-1]&&a[x][y-1]!='#'&&a[x][y-1]!='Y'&&a[x][y-1]!='M')
        {
            r++;qx[r]=x;qy[r]=y-1;
            used[x][y-1]=true;step[r]=step[l]+1;
            if(a[x][y-1]=='@') kfc2[x][y-1]=step[r];
        }
//------------------------------------------------------------------------------------------------
        if(y+1<=m&&!used[x][y+1]&&a[x][y+1]!='#'&&a[x][y+1]!='Y'&&a[x][y+1]!='M')
        {
            r++;qx[r]=x;qy[r]=y+1;
            used[x][y+1]=true;step[r]=step[l]+1;
            if(a[x][y+1]=='@') kfc2[x][y+1]=step[r];
        }
//--------------------------------------------------------------------------------------------------
        if(x-1>=1&&!used[x-1][y]&&a[x-1][y]!='#'&&a[x-1][y]!='Y'&&a[x-1][y]!='M')
        {
            r++;qx[r]=x-1;qy[r]=y;
            used[x-1][y]=true;step[r]=step[l]+1;
            if(a[x-1][y]=='@') kfc2[x-1][y]=step[r];
        }
//----------------------------------------------------------------------------------------------------
        if(x+1<=n&&!used[x+1][y]&&a[x+1][y]!='#'&&a[x+1][y]!='Y'&&a[x+1][y]!='M')
        {
            r++;qx[r]=x+1;qy[r]=y;
            used[x+1][y]=true;step[r]=step[l]+1;
            if(a[x+1][y]=='@') kfc2[x+1][y]=step[r];
        }
//-------------------------------------------------------------------------------------------------
    l++;
    }
}
int main()
{
    int i,j;
    while(scanf("%d%d",&n,&m)!=(EOF))
    {
        for(i=1;i<=n;i++)
        {
            getchar();
            for(j=1;j<=m;j++)
                scanf("%c",&a[i][j]);
        }
//-----------------------------------------------------------------------------------
        for(i=1;i<=n;i++)
            for(j=1;j<=m;j++)
            if(a[i][j]=='Y')
                bfs1(i,j);
        for(i=1;i<=n;i++)
            for(j=1;j<=m;j++)
            if(a[i][j]=='M')
                bfs2(i,j);
//--------------------------------------------------------------------------------------
        mi=m*n+1;sum=0;
        for(i=1;i<=n;i++)
            for(j=1;j<=m;j++)
            if(a[i][j]=='@')
        {
            //printf("%d %d\n",kfc1[i][j],kfc2[i][j]);
            sum=kfc1[i][j]+kfc2[i][j];
            if(sum<mi) mi=sum;
        }
        printf("%d\n",mi*11);
    }
    return 0;
}