HDU

*：使用

Sample Input
4 4
Y.#@
....
.#..
@..M
4 4
Y.#@
....
.#..
@#.M
5 5
Y..@.
.#...
.#...
@..M.
#...#
Sample Output
66
88
66

**************************************************

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<queue>
#include<stdlib.h>
#include<map>
#include<cmath>

using namespace std;

#define N 350
#define INF 0x3f3f3f3f

struct node
{
    int x,y,step;
};

int w[4][2]= { {0,1},{0,-1},{1,0},{-1,0} };
int n,m,vis[N][N], v[N][N];
char str[N][N];

void bfs(node s)
{
    int i;

    queue<node>Q;
    node q;
    s.step=0;
    Q.push(s);
    vis[s.x][s.y]=1;

    while(Q.size())
    {
        q=Q.front();
        Q.pop();

        if(str[q.x][q.y]=='@')
            v[q.x][q.y]+=q.step;

        for(i=0; i<4; i++)
        {
            s.x=q.x+w[i][0];
            s.y=q.y+w[i][1];
            if(s.x>=0&&s.x<n&&s.y>=0&&s.y<m&&vis[s.x][s.y]==0&&str[s.x][s.y] != '#')
            {
                vis[s.x][s.y]=1;
                s.step=q.step+1;
                Q.push(s);
            }
        }
    }
}

int main()
{
    int i,j;
    node s1,s2;

    while(scanf("%d %d", &n,&m) != EOF)
    {
        memset(v,0,sizeof(v));
        memset(vis,0,sizeof(vis));
        memset(str,0,sizeof(str));

        for(i=0; i<n; i++)
        {
            scanf("%s", str[i]);
            for(j=0; j<m; j++)
            {
                if(str[i][j]=='Y')
                    s1.x=i,s1.y=j;
                if(str[i][j]=='M')
                    s2.x=i,s2.y=j;
            }
        }

        bfs(s1);
        memset(vis,0,sizeof(vis));
        bfs(s2);


        int ans=INF;
        for(i=0; i<n; i++)
            for(j=0; j<m; j++)
                if(v[i][j] != 0)
                    ans=min(ans,v[i][j]);

        printf("%d
", ans*11);
    }
    return 0;
}