HDU 2612 Find a way

题意：在一个矩阵中，每移动一次花费一个单位时间，移动到相邻的一格中，从Y点开始移动，经过任意一个@点，到达M，求最短花费时间

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

思路：从Y,M两点分别开始广搜，找到这两点到达某个@的最短时间

注意点：无

以下为AC代码：

Run ID	Submit Time	Judge Status	Pro.ID	Exe.Time	Exe.Memory	Code Len.	Language	Author
13001131	2015-02-28 17:21:22	Accepted	2612	31MS	1540K	2524 B	G++	luminous

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <vector>
#include <deque>
#include <list>
#include <cctype>
#include <algorithm>
#include <climits>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <cstdlib>
#include <ctime>
#define ll long long
#define ull unsigned long long
#define all(x) (x).begin(), (x).end()
#define clr(a, v) memset( a , v , sizeof(a) )
#define pb push_back
#define mp make_pair
#define read(f) freopen(f, "r", stdin)
#define write(f) freopen(f, "w", stdout)
using namespace std;
//const double pi = acos(-1);
//const double eps = 1e-10;
int dir[4][2] = { 1,0, -1,0, 0,1, 0,-1 };
char str[205][205];
int adj[2][205][205];
int m, n;
struct node{
    int x, y;
    node(){}
    node( int _x, int _y ) : x(_x), y(_y) {}
};
void init()
{
    clr ( str, '#' );
    clr ( adj, 0x3f3f3f3f );
    for ( int i = 1; i <= m; i ++ ){
        scanf ( "%s", &str[i][1] );
        str[i][n+1] = '#';
    }
}
void bfs ( int x, int y, int k )
{
    queue<node> q;
    adj[k][x][y] = 0;
    q.push ( node ( x, y ) );
    while ( ! q.empty() ){
        node tmp = q.front();
        q.pop();
        for ( int i = 0; i < 4; i ++ ){
            int xi = tmp.x + dir[i][0];
            int yi = tmp.y + dir[i][1];
            if ( xi < 0 || xi > m || yi < 0 || yi > n || str[xi][yi] == '#' )continue;
            if ( adj[k][xi][yi] > adj[k][tmp.x][tmp.y] + 1 ){
                adj[k][xi][yi] = adj[k][tmp.x][tmp.y] + 1;
                q.push ( node( xi, yi ) );
            }
        }
    }
}
void print( int k ) //test
{
    for ( int i = 1; i <= m; i ++ ){
        for ( int j = 1; j <= n; j ++ ){
            cout << adj[k][i][j] << ' ';
        }
        cout << endl;
    }
}
int solve()
{
    for ( int i = 1; i <= m; i ++ ){
        for ( int j = 1; j <= n; j ++ ){
            if ( str[i][j] == 'Y' )
                bfs ( i, j, 0 );
            if ( str[i][j] == 'M' )
                bfs ( i, j, 1 );
        }
    }
    int ans = 0x3f3f3f3f;
    for ( int i = 1; i <= m; i ++ ){
        for ( int j = 1; j <= n; j ++ ){
            if ( str[i][j] == '@' ){
                ans = min ( ans, adj[0][i][j] + adj[1][i][j] );
            }
        }
    }
    return ans;
}
int main()
{
    while ( scanf ( "%d%d", &m, &n ) != EOF ){
        init();
        printf ( "%d\n", solve() * 11 );
    }
    return 0;
}