題目鏈接：http://acm.hdu.edu.cn/showproblem.php?pid=3085

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

題意：

給定 $n \times m$ 的地圖，現在地圖上一些格子是墻，人不能通過。地圖上有一個男孩和一個女孩，男孩一次能朝一個方向跑 $3$ 格，女孩一次能朝一個方向跑 $1$ 格。

現在地圖上有兩個幽靈，幽靈每秒鐘可以向四周擴撒 $2$ 格，被擴散的格子都會變成有幽靈的，墻不能阻擋幽靈，它們會一直擴散知道遍布整個地圖。

假設每個單位時間內，都是幽靈先於男孩女孩移動。現在問你男孩和女孩在不碰到幽靈的前提下，能不能會和在一個格子。

題解：

HDU 3085 - Nightmare Ⅱ - []