Problem 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
#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <queue>
using namespace std;
const int INF=0x3f3f3f3f;
int dir_x[4]={1,-1,0,0};
int dir_y[4]={0,0,1,-1};
struct node
{
int x,y,t;
};
char map[15][15];
int vis[15][15],n,m,tot,ans,run;
bool flag=false;
queue<node> q[2];
node NA[120];
bool inside(node a)
{
if(a.x>=0&&a.x<n&&a.y>=0&&a.y<m) return true;
return false;
}
void bfs(int k,int sum)
{
if(sum==tot) flag=true;
node u,v;int sin=0;
int f=0;
while(!q[k].empty())
{
v=q[k].front();q[k].pop();
for(int i=0;i<4;i++)
{
u=v;u.x+=dir_x[i];u.y+=dir_y[i]; u.t+=1;
if(inside(u)&&map[u.x][u.y]=='#'&&vis[u.x][u.y]==0)
{
vis[u.x][u.y]=1; sin++;
run=max(run,u.t);
q[!k].push(u);
}
}
}
if(sum+sin==tot) flag=true;
if(!q[!k].empty())
bfs(!k,sum+sin);
}
int main()
{
int t,cas=1;
scanf("%d",&t);
while(t--)
{
scanf("%d%d",&n,&m);
memset(map,0,sizeof(map));
memset(NA,0,sizeof(NA));
memset(vis,0,sizeof(vis));
ans=INF;tot=0;run=0;
while(!q[0].empty()) q[0].pop();
while(!q[1].empty()) q[1].pop();
for(int i=0;i<n;i++) scanf("%s",map[i]);
for(int i=0;i<n;i++)
{
for(int j=0;j<m;j++)
{
if(map[i][j]=='#')
{
NA[tot++]=(node){i,j,0};
}
}
}
if(tot<=2) ans=0;
else
{
for(int i=0;i<tot;i++)
{
for(int j=i+1;j<tot;j++)
{
q[0].push(NA[i]); q[1].push(NA[j]);
memset(vis,0,sizeof(vis));
run=0;flag=false;
vis[NA[i].x][NA[i].y]=vis[NA[j].x][NA[j].y]=1;
bfs(0,2);
if(flag&&ans>run) ans=run;
}
}
}
if(ans==INF) ans=-1;
printf("Case %d: %d\n",cas++,ans);
}
return 0;
}
相关推荐
求最大乘积 的源代码 次题是fzu 4月月赛题 是一道数学题啊
fzu online judge 的几道题,我的解题过程与思路,虽然都是很easy的题目,不过,重在参与嘛,哈哈
2021FZU计算机视觉作业(九)
2021FZU计算机视觉作业(七)
2021FZU计算机视觉作业(八)
2021FZU计算机视觉期末复习
不要下载此版的,请下载最新的http://download.csdn.net/source/1664620 离线版的福大acm在线评测OJ系统题目 更新到2009年8月 (注:chm电子书格式化)
fzu大数据基础实验4
C#miniword完整版,FZU作业,MINIWORD
FZU软件工程web课程复习资料-整理
FZU2021计算机视觉慕课答案(一)
FZU软件工程操作系统课程复习资料-整理
这是关于我们飞跃手册项目的相关文档,包括成员分组信息表格,各组成员任务概要文档,项目日记等文档。 (This is a collection of documents relating to our Leapfrog Handbook project, including member ...
FZU2021计算机视觉答案(三)
FZU2021计算机视觉答案(四)
2021FZU计算机视觉答案(五)
2021FZU计算机视觉答案(二 )
2021FZU计算机视觉答案(六)
2011 ACM 多校联合 2011 MU11 13 FZU
ACM数学_FZU...............绝密..........