Fire Game——BFS

D - Fire Game

Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u

Description

Fat brother and Maze are playing a kind of special (hentai) game on an N*M board (N rows, M columns). At the beginning, each grid of this board is consisting of grass or just empty and then they start to fire all the grass. Firstly they choose two grids which are consisting of grass and set fire. As we all know, the fire can spread among the grass. If the grid (x, y) is firing at time t, the grid which is adjacent to this grid will fire at time t+1 which refers to the grid (x+1, y), (x-1, y), (x, y+1), (x, y-1). This process ends when no new grid get fire. If then all the grid which are consisting of grass is get fired, Fat brother and Maze will stand in the middle of the grid and playing a MORE special (hentai) game. (Maybe it’s the OOXX game which decrypted in the last problem, who knows.)

You can assume that the grass in the board would never burn out and the empty grid would never get fire.

Note that the two grids they choose can be the same.

Input

The first line of the date is an integer T, which is the number of the text cases.

Then T cases follow, each case contains two integers N and M indicate the size of the board. Then goes N line, each line with M character shows the board. “#” Indicates the grass. You can assume that there is at least one grid which is consisting of grass in the board.

1 <= T <=100, 1 <= n <=10, 1 <= m <=10

Output

For each case, output the case number first, if they can play the MORE special (hentai) game (fire all the grass), output the minimal time they need to wait after they set fire, otherwise just output -1. See the sample input and output for more details.

Sample Input

4
3 3
.#.
###
.#.
3 3
.#.
#.#
.#.
3 3
...
#.#
...
3 3
###
..#
#.#

Sample Output

Case 1: 1
Case 2: -1
Case 3: 0
Case 4: 2

题意（很黄很暴力）：两个人玩一个特殊游戏棋盘游戏。棋盘每一个格子上可能放草，也可能不放。现在两个人各自选一个格子放火，如果最终所有格子上都没有了草，则他们俩就OOXX。。。。如果能OOXX，就输出所需要的最小时间（火向每一个格子移动所需的时间是1s），否则，输出-1。

思路：BFS。这是我第一次做起始点有多个的，记录步数也是头一遭（我太水了。。。）

AC代码

#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<iomanip>
#include<algorithm>
#include<cmath>
#include<queue>
using namespace std;
const int MAX=1000000;
int dir[4][2]= {{1,0},{-1,0},{0,1},{0,-1}};
int vis[15][15];
int m,n,tot;
char s[15][15];
int d[15][15];
struct Node
{
    int x,y,t;
};
Node a,b;
int bfs()
{
    int flag=1;
    int cnt=2,ans=-1;
    queue<Node> q;
    q.push(a),q.push(b);
    vis[a.x][a.y]=1,vis[b.x][b.y]=1;
    int time=0;
    while(!q.empty())
    {
        Node next;
        Node tmp=q.front();
        time=tmp.t;
        for(int i=0; i<4; i++)
        {
            next.x=tmp.x+dir[i][0];
            next.y=tmp.y+dir[i][1];
            next.t=tmp.t+1;
            if(next.x>=0 && next.x<m && next.y>=0 && next.y<n && !vis[next.x][next.y] && s[next.x][next.y]=='#')
            {
                vis[next.x][next.y]=1;
                q.push(next);
            }
        }
        q.pop();
    }
    for(int i=0; i<m; i++)//遍历所有草是否被访问到，即是否所有草都被烧掉
    {
        for(int j=0; j<n; j++)
            if(!vis[i][j] && s[i][j]=='#')
                return MAX;
    }
    return time;
}


int main()
{
    int t,i,j,ca=1;
    cin>>t;
    for(ca=1; ca<=t; ca++)
    {

        Node node[100];
        cin>>m>>n;
        tot=0;
        for(i=0; i<m; i++)
        {
            for(j=0; j<n; j++)
            {
                cin>>s[i][j];
                if(s[i][j]=='#')
                {
                    node[tot].x=i,node[tot].y=j;//将所有有草的点放在一起
                    tot++;
                }
            }
        }
        if(tot==1 || tot==2)//只有1或2个，耗时0s
        {
            printf("Case %d: 0\n",ca);
        }
        else
        {
            int mi=MAX;
            for(i=0; i<tot; i++)//任意两堆草组合
            {
                for(j=i+1; j<tot; j++)
                {
                    memset(vis,0,sizeof(vis));
                    a=node[i],b=node[j];
                    a.t=0,b.t=0;
                    int time=bfs();//求时间，并更新最小值
                    if(mi>time) mi=time;
                }
            }
            if(mi==MAX)printf("Case %d: -1\n",ca);
            else printf("Case %d: %d\n",ca,mi);

        }
    }
    return 0;
}