fzu2150（广搜）

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

题意：给出一个m*n的图，‘#’表示草坪，‘ . ’表示空地，然后可以选择在任意的两个草坪格子点火，火每 1 s会向周围四个格子扩散，问选择那两个点使得燃烧所有的草坪花费时间最小？

思路：刚开始理解错题意了wa了，结果发现还是bfs靠谱，深搜无限wa，后来改成广搜了也bug多多，反正数据小就暴力，最后改改改的也过了……

#include<stdio.h>
#include<algorithm>
#include<queue>
#include<vector>
#include<iostream>
#include<string.h>
using namespace std;
char xx[15][15];
int fx[4][2]= {{1,0},{-1,0},{0,1},{0,-1}};
int vis[15][15];
int num;
int m,n;
void dfs(int x,int y)
{
    vis[x][y]=1;
    for(int i=0; i<4; i++)
    {
        int tx=x+fx[i][0],ty=y+fx[i][1];
        if(tx>=0&&tx<m&&ty>=0&&ty<n&&xx[tx][ty]=='#'&&!vis[tx][ty])
        {
            vis[tx][ty]=1;
            dfs(tx,ty);
        }
    }
}
int vv[15][15]= {{0}};
void dfs3(int x,int y)
{
    vv[x][y]=1;
    for(int i=0; i<4; i++)
    {
        int tx=x+fx[i][0],ty=y+fx[i][1];
        if(tx>=0&&tx<m&&ty>=0&&ty<n&&xx[tx][ty]=='#'&&!vv[tx][ty])
        {
            vis[tx][ty]=1;
            dfs3(tx,ty);
        }
    }
}
struct data
{
    int x,y,step;
    data(int a,int b,int c)
    {
        x=a,y=b,step=c;
    }
};
int main()
{
    int t,o=1;
    cin>>t;
    while(t--)
    {
        memset(vis,0,sizeof(vis));
        memset(vv,0,sizeof(vv));
        cin>>m>>n;
        num=0;
        for(int i=0; i<m; i++)
            for(int j=0; j<n; j++)
                cin>>xx[i][j];
        printf("Case %d: ",o++);
        for(int i=0; i<m; i++)
            for(int j=0; j<n; j++)
                if(xx[i][j]=='#'&&!vis[i][j])
                    dfs(i,j),num++;
        //cout<<num<<endl;
        if(num>2)
            puts("-1");
        else
        {
            if(num==2)
            {
                for(int i=0; i<m; i++)
                {
                    int ff=0;
                    for(int j=0; j<n; j++)
                        if(xx[i][j]=='#')
                        {
                            ff=1;
                            dfs3(i,j);
                            break;
                        }
                    if(ff)
                        break;
                }
                int ans1=1e9,ans2=1e9;
                for(int i=0; i<m; i++)
                    for(int j=0; j<n; j++)
                    {
                        if(vv[i][j]==1)
                        {
                            int vis0[15][15]= {{0}},max1=0;
                            queue<data>q;
                            data tem(i,j,0);
                            q.push(tem);
                            while(!q.empty())
                            {
                                data tee=q.front();
                                vis0[tee.x][tee.y]=1;
                                max1=max(max1,tee.step);
                                q.pop();
                                for(int i=0; i<4; i++)
                                {
                                    int tx=tee.x+fx[i][0],ty=tee.y+fx[i][1];
                                    if(tx>=0&&tx<m&&ty>=0&&ty<n&&vv[tx][ty]==1&&!vis0[tx][ty])
                                    {
                                        vis0[tx][ty]=1;
                                        data hh(tx,ty,tee.step+1);
                                        q.push(hh);
                                    }
                                }
                            }
                            ans1=min(ans1,max1);
                        }
                        else if(xx[i][j]=='#')
                        {
                            int vis0[15][15]= {{0}},max1=0;
                            queue<data>q;
                            data tem(i,j,0);
                            q.push(tem);
                            while(!q.empty())
                            {
                                data tee=q.front();
                                vis0[tee.x][tee.y]=1;
                                max1=max(max1,tee.step);
                                q.pop();
                                for(int i=0; i<4; i++)
                                {
                                    int tx=tee.x+fx[i][0],ty=tee.y+fx[i][1];
                                    if(tx>=0&&tx<m&&ty>=0&&ty<n&&xx[tx][ty]=='#'&&!vis0[tx][ty]&&vv[tx][ty]!=1)
                                    {
                                        vis0[tx][ty]=1;
                                        data hh(tx,ty,tee.step+1);
                                        q.push(hh);
                                    }
                                }
                            }
                            ans2=min(ans2,max1);
                        }
                    }
                cout<<max(ans1,ans2)<<endl;
            }
            else if(num==1)
            {
                int ans=1e9,flag=0;
                for(int i=0; i<m; i++)
                    for(int j=0; j<n; j++)
                        if(xx[i][j]=='#')
                            for(int k=0; k<m; k++)
                                for(int h=0; h<n; h++)
                                    if((k>i||(k==i&&h>j))&&xx[k][h]=='#')
                                    {
                                        flag=1;
                                        int vis0[15][15]= {{0}},max1=0;
                                        queue<data>q;
                                        data t1(i,j,0);
                                        data t2(k,h,0);
                                        q.push(t1);
                                        q.push(t2);
                                        vis0[i][j]=1;
                                        vis0[k][h]=1;
                                        while(!q.empty())
                                        {
                                            data tee=q.front();
                                            vis0[tee.x][tee.y]=1;
                                            max1=max(max1,tee.step);
                                            q.pop();
                                            for(int i=0; i<4; i++)
                                            {
                                                int tx=tee.x+fx[i][0],ty=tee.y+fx[i][1];
                                                if(tx>=0&&tx<m&&ty>=0&&ty<n&&xx[tx][ty]=='#'&&!vis0[tx][ty])
                                                {
                                                    vis0[tx][ty]=1;
                                                    data hh(tx,ty,tee.step+1);
                                                    q.push(hh);
                                                }
                                            }
                                        }
                                        ans=min(ans,max1);
                                    }
                if(!flag)
                    cout<<0<<endl;
                else
                    cout<<ans<<endl;
            }
            else puts("0");
        }
    }
    return 0;
}