HDU 2612 Find a way【第一次双BFS】

Find a way

Time Limit : 3000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other)

Total Submission(s) : 15   Accepted Submission(s) : 5

Font: Times New Roman | Verdana | Georgia

Font Size: ← →

Problem Description

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.

Input

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

Output

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.

Sample Input

4 4
Y.#@
....
.#..
@..M
4 4
Y.#@
....
.#..
@#.M
5 5
Y..@.
.#...
.#...
@..M.
#...#

Sample Output

66
88
66

以为什么是双BFS 原来就是用两次BFS 我以为有多神秘呢......

#include<stdio.h>
#include<algorithm>
#include<cstring>
#include<queue>
using namespace std;
int step[4][2]= {1,0,-1,0,0,1,0,-1};
bool vis[210][210];
char map[210][210];
int stepnum[2][210][210];
int n,m;
struct node
{
    int x,y,step;
};
int check(int x,int y)
{
    if(x>=1&&x<=n&&y>=1&&y<=m&&map[x][y]!='#')
        return 1;
    return 0;
}
void BFS(int a ,int x,int y)
{
    memset(vis,false,sizeof(vis));

    vis[x][y]=true;
    node point,newpoint;

    queue<node> q;
    point.x=x;
    point.y=y;
    point.step=0;
    q.push(point);

    while(!q.empty())
    {
        point=q.front();
        q.pop();
        if(map[point.x][point.y]=='@')//遇到KFC 记录所走的步数
        {
            stepnum[a][point.x][point.y]=point.step;
        }
        for(int i=0; i<4; i++)
        {
            newpoint.x=point.x+step[i][0];
            newpoint.y=point.y+step[i][1];
            if(check(newpoint.x,newpoint.y)&&!vis[newpoint.x][newpoint.y])
            {
                vis[newpoint.x][newpoint.y]=true;
                newpoint.step=point.step+1;//每走一格 步数+1
                q.push(newpoint);
            }
        }
    }
}
int main (void)
{
    while(~scanf("%d%d",&n,&m))
    {
        int ax,ay,bx,by;
        getchar();
        for(int i=1; i<=n; i++)
        {
            for(int ii=1; ii<=m; ii++)
            {
                scanf("%c",&map[i][ii]);
                if(map[i][ii]=='Y')
                {
                    ax=i;
                    ay=ii;
                }
                else if(map[i][ii]=='M')
                {
                    bx=i;
                    by=ii;
                }
            }
            getchar();
        }
        memset(stepnum,0x3f3f3f3f,sizeof(stepnum));//一定要放在BFS之前 如果放在BFS里面，第二次BFS时，会把第一次BFS的值覆盖 结果出错
        BFS(0,ax,ay);
        BFS(1,bx,by);
        int step_num=0x3f3f3f3f;
        for(int i=1; i<=n; i++)
        {
            for(int ii=1; ii<=m; ii++)
            {
                if(map[i][ii]=='@')//找出同一个KFC中需要走最小的那个点
                {
                    step_num=min(step_num,stepnum[0][i][ii]+stepnum[1][i][ii]);
                }
            }
        }
        printf("%d\n",step_num*11);
    }
    return 0;
}

/*
4 4
Y.#@
....
.#..
@..M
4 4
Y.#@
....
.#..
@#.M
5 5
Y..@.
.#...
.#...
@..M.
#...#
*/