题意:给出一个m*n的图,‘#’表示草坪,‘ . ’表示空地,然后可以选择在任意的两个草坪格子点火,火每 1 s会向周围四个格子扩散,问选择那两个点使得燃烧所有的草坪花费时间最小?
分析:这个题目如果考虑技巧的话有点难度,但是鉴于数据范围比较小,我们可以暴力枚举任意的草坪所在的点,然后两个点压进队列里面BFS,去一个满足条件的最小值即可。一眼就瞟到了题解。。。。写得挺长,不过没啥难度
#include <cstdio>
#include <iostream>
#include <cstring>
#include <string>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <list>
#include <queue>
#include <map>
using namespace std;
#define L(i) i<<1
#define R(i) i<<1|1
#define INF 0x3f3f3f3f
#define pi acos(-1.0)
#define eps 1e-4
#define maxn 100010
#define MOD 1000000007
char s[16][16];
int vis[11][11];
int n,m,k;
int mx[4] = {0,0,1,-1};
int my[4] = {1,-1,0,0};
struct node1
{
int x,y;
} a[100010];
struct node
{
int x,y,t;
} st,ss;
int bfs(int x,int y)
{
int num = 0,ans = 0;
queue<node > q;
st.x = a[x].x;
st.y = a[x].y;
st.t = 0;
q.push(st);
st.x = a[y].x;
st.y = a[y].y;
st.t = 0;
q.push(st);
num = 2;
vis[a[x].x][a[x].y] = 1;
vis[a[y].x][a[y].y] = 1;
while(!q.empty())
{
st = q.front();
q.pop();
//printf("%d %d\n",st.x,st.y);
for(int i = 0; i < 4; i++)
{
int dx = st.x + mx[i];
int dy = st.y + my[i];
if(dx < 0 || dx >= n || dy < 0 || dy >= m)
continue;
if(vis[dx][dy] || s[dx][dy] == '.')
continue;
ss.x = dx;
ss.y = dy;
ss.t = st.t + 1;
ans = max(ans,ss.t);
num++;
if(num == k)
return ans;
vis[dx][dy] = 1;
q.push(ss);
}
}
return INF;
}
int main()
{
int t,c = 1;
scanf("%d",&t);
while(t--)
{
k = 0;
scanf("%d%d",&n,&m);
for(int i = 0; i < n; i++)
scanf("%s",s[i]);
for(int i = 0; i < n; i++)
for(int j = 0; j < m; j++)
if(s[i][j] == '#')
{
a[k].x = i;
a[k++].y = j;
}
if(k <= 2)
{
printf("Case %d: %d\n",c++,0);
continue;
}
int ans = INF;
for(int i = 0; i < k; i++)
for(int j = i+1; j < k; j++)
{
memset(vis,0,sizeof(vis));
ans = min(ans,bfs(i,j));
}
printf("Case %d: %d\n",c++,ans==INF?-1:ans);
}
return 0;
}