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
Sample Output
题意 :就是有两个熊孩子要把一个正方形上的草都给烧掉,他俩同时放火烧,
烧第一块的时候是不花时间的,每一块着火的都可以在下一秒烧向上下左右
四块#代表草地,. 代表着不能烧的。问你最少花多少时间可以烧掉,
如果烧不掉就输出-1
枚举两个草地 可以是同一个草地 用BFS 搜 不可行输出-1
可行更新最小时间
#include
#include
#include
#include
using namespace std;
int n,m,sum;
char a[12][12];
int map[12][12];
int x[]= {1,0,-1,0};
int y[]= {0,1,0,-1};
struct node
{
int x,y,tep;
};
queue
Q; queue
F; node xx,yy; int bfs() { int i,j,k,maxn=0,temp=2; node qq,ff; while(!Q.empty())Q.pop(); Q.push(xx); Q.push(yy); if(xx.x==yy.x&&xx.y==yy.y) temp--; while(!Q.empty()) { xx=Q.front(); Q.pop(); qq.tep=xx.tep+1; for(i=0; i<4; i++) { qq.x=xx.x+x[i]; qq.y=xx.y+y[i]; if(qq.x>=0&&qq.x
=0&&qq.y