HDU - 2612 Find a Way bfs及理解

题目
Pass a year learning in Hangzhou, yifenfei arrival hometown Ningbo at finally. Leave Ningbo one year, yifenfei have many people to meet. Especially a good friend Merceki.
Yifenfei’s home is at the countryside, but Merceki’s home is in the center of city. So yifenfei made arrangements with Merceki to meet at a KFC. There are many KFC in Ningbo, they want to choose one that let the total time to it be most smallest.
Now give you a Ningbo map, Both yifenfei and Merceki can move up, down ,left, right to the adjacent road by cost 11 minutes.
输入
The input contains multiple test cases.
Each test case include, first two integers n, m. (2<=n,m<=200).
Next n lines, each line included m character.
‘Y’ express yifenfei initial position.
‘M’ express Merceki initial position.
‘#’ forbid road;
‘.’ Road.
‘@’ KCF
输出
For each test case output the minimum total time that both yifenfei and Merceki to arrival one of KFC.You may sure there is always have a KFC that can let them meet.

题意：
mf要在kfc见面，要求两人总的到kfc的步数最少

题解
两遍搜索，第一遍记录y到地图中每一个kfc的步数，第二遍记录m到地图中每一个kfc的步数，然后循环找出两人到同一个kfc的最小步数，×11输出，注意多组输入，所以每次的初始化得做好
下面粘代码

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

char maze[207][207];                      //记录地图
int sty[203][203];                        //记录步数
int stm[203][203];
int dx[4]={1,-1,0,0},dy[4]={0,0,1,-1};    //调整方向
bool check[203][203];                     //记录来过没有
int n,m;

struct info
{
    int x,y;
};

void bfs(int st[][203],info p)
{
    queue<info> que;
    que.push(p);
    st[p.x][p.y]=0;
    while(que.size())
    {
        info p=que.front();
        que.pop();
        for(int i=0;i<4;i++)
        {
            int nx=p.x+dx[i],ny=p.y+dy[i];
            if(nx>=0&&nx<=n&&ny>=0&&ny<=m&&!check[nx][ny]&&maze[nx][ny]!='#')
            {
                 st[nx][ny]=st[p.x][p.y]+1;
                 check[nx][ny]=true;
                 que.push(info{nx,ny});

            }

        }

    }

}

int main()
{
    while(cin>>n>>m)
    {
        memset(sty,0,sizeof(sty));
        memset(stm,0,sizeof(stm));
        memset(maze,0,sizeof(maze));
        memset(check,false,sizeof(check));
        info sm,sy;
        for(int i=0;i<n;i++)
            for(int j=0;j<m;j++)
            {
              cin>>maze[i][j];
              if(maze[i][j]=='Y')
                sy.x=i,sy.y=j;
              if(maze[i][j]=='M')
                sm.x=i,sm.y=j;
            }
        bfs(sty,sy);
        memset(check,false,sizeof(check));
        bfs(stm,sm);
        int mint=99999999;
        for(int i=0;i<n;i++)
            for(int j=0;j<m;j++)
                if(maze[i][j]=='@')
                   mint=min(mint,stm[i][j]+sty[i][j]);
    cout<<mint*11<<endl;
    }
    return 0;
}

感谢观看！
--------2021年再写这个题，补充
补充的原因就是我第二次碰到这个题的时候，想着用栈来实现bfs，哈哈，失败了，原因就在pop的时候，优先顺序错误，又去查了查，找到了上图这种理解，以此记录一下