HDU3085(KB2-G 双向bfs)

Nightmare Ⅱ

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2196    Accepted Submission(s): 572

Problem Description

Last night, little erriyue had a horrible nightmare. He dreamed that he and his girl friend were trapped in a big maze separately. More terribly, there are two ghosts in the maze. They will kill the people. Now little erriyue wants to know if he could find his girl friend before the ghosts find them.
You may suppose that little erriyue and his girl friend can move in 4 directions. In each second, little erriyue can move 3 steps and his girl friend can move 1 step. The ghosts are evil, every second they will divide into several parts to occupy the grids within 2 steps to them until they occupy the whole maze. You can suppose that at every second the ghosts divide firstly then the little erriyue and his girl friend start to move, and if little erriyue or his girl friend arrive at a grid with a ghost, they will die.
Note: the new ghosts also can devide as the original ghost.

 

Input

The input starts with an integer T, means the number of test cases.
Each test case starts with a line contains two integers n and m, means the size of the maze. (1<n, m<800)
The next n lines describe the maze. Each line contains m characters. The characters may be:
‘.’ denotes an empty place, all can walk on.
‘X’ denotes a wall, only people can’t walk on.
‘M’ denotes little erriyue
‘G’ denotes the girl friend.
‘Z’ denotes the ghosts.
It is guaranteed that will contain exactly one letter M, one letter G and two letters Z. 

 

Output

Output a single integer S in one line, denotes erriyue and his girlfriend will meet in the minimum time S if they can meet successfully, or output -1 denotes they failed to meet.

 

Sample Input

3

5 6

XXXXXX

XZ..ZX

XXXXXX

M.G...

......

5 6

XXXXXX

XZZ..X

XXXXXX

M.....

..G...

10 10

..........

..X.......

..M.X...X.

X.........

.X..X.X.X.

.........X

..XX....X.

X....G...X

...ZX.X...

...Z..X..X

 

Sample Output

1

1

-1

 

被读入卡了超时，按行读快，一个一个读超时

//2017-03-08
#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>

using namespace std;

struct node 
{
    int x, y;
    void setNode(int x, int y)
    {
        this->x = x;
        this->y = y;
    }
};
int n, m, zx[2], zy[2], ans, TIME;
char grid[850][850];
bool vis[2][850][850], ok;
int dx[4] = {0, 0, 1, -1};
int dy[4] = {1, -1, 0, 0};
queue<node> q[2];

bool judge(int x, int y)
{
    if(grid[x][y] == 'X')return false;
    for(int i = 0; i < 2; i++)
        if((abs(x-zx[i])+abs(y-zy[i]))<=2*TIME)
            return false;
    return true;
}

bool bfs(int id)
{
    int x, y, nx, ny, s;
    node tmp;
    s = q[id].size();
    while(s--)
    {
        x = q[id].front().x;
        y = q[id].front().y;
        q[id].pop();
        if(!judge(x, y))continue;
        for(int i = 0; i < 4; i++)
        {
            nx = x + dx[i];
            ny = y + dy[i];
            if(nx>=0&&nx<n&&ny>=0&&ny<m&&judge(nx, ny)&&!vis[id][nx][ny])
            {
                if(vis[id^1][nx][ny]){
                    ok = true;
                    return true;
                }
                vis[id][nx][ny] = 1;
                tmp.setNode(nx, ny);
                q[id].push(tmp);
            }
        }
    }
    return false;
}

int main()
{
    int T;
    scanf("%d", &T);
    while(T--)
    {
        node tmp;
        while(!q[0].empty())q[0].pop();
        while(!q[1].empty())q[1].pop();
        memset(vis, 0, sizeof(vis));
        scanf("%d%d", &n, &m);
        getchar();
        for(int i = 0; i < n; i++)//被读入卡了超时，按行读快，一个一个读超时
              scanf("%s", grid[i]);
        int cnt = 0;
        for(int i = 0; i < n; i++)
        {
            for(int j = 0; j < m; j++)
            {
                if(grid[i][j] == 'Z'){
                    zx[cnt] = i;
                    zy[cnt] = j;
                    cnt++;
                }
                if(grid[i][j] == 'M'){
                    tmp.setNode(i, j);
                    vis[0][i][j] = 1;
                    q[0].push(tmp);
                }
                if(grid[i][j] == 'G'){
                    tmp.setNode(i, j);
                    vis[1][i][j] = 1;
                    q[1].push(tmp);
                }
            }
        }
        ok = false;
        TIME = 0;
        while(!q[0].empty() || !q[1].empty())
        {
            TIME++;
            if(bfs(0))break;
            if(bfs(0))break;
            if(bfs(0))break;
            if(bfs(1))break;
        }
        if(ok)printf("%d
", TIME);
        else printf("-1
");
    }
    return 0;
}