题目:http://acm.fzu.edu.cn/problem.php?pid=2150
n*m的栅格中,“#”代表草地,“.”代表空地,从中选取两块草地点上火(选取的两块草地可以是同一块),点着后火向前后左右四个方向的草地蔓延,问最少多少时间能烧到所有草地?
数据较小,可以枚举要点火的两块草地。
#include<iostream>
#include<algorithm>
#include<cstring>
#include<string>
#include<cstdio>
#include<queue>
#define pii pair<int, int>
using namespace std;
const int INF = 0x3f3f3f3f;
const int MAXN = 15;
int n, m;
char grid[MAXN][MAXN];
int vis[MAXN][MAXN]; // i行j列的草地是否烧过
int cost[MAXN][MAXN]; // i行j列的草地被烧到的时间
int dir[4][2] = {0, 1, 1, 0, 0, -1, -1, 0};
int min_cost = INF;
void get_ans()
{
int ans = -1;
for(int i = 0; i < n; i++)
{
for(int j = 0; j < m; j++)
{
if(grid[i][j] == '#' && !vis[i][j])
return ;
// 以最大时间作为烧完这片草地的时间
if(grid[i][j] == '#' && cost[i][j] > ans) ans = cost[i][j];
}
}
min_cost = min(min_cost, ans);
}
void bfs(int a1, int b1, int a2, int b2)
{
memset(vis, 0, sizeof(vis)); vis[a1][b1] = 1;
memset(cost, 0, sizeof(cost));
queue<pii> q;
q.push(pii(a1, b1));
if(!vis[a2][b2])
{
vis[a2][b2] = 1;
q.push(pii(a2, b2));
}
while(!q.empty())
{
int x = q.front().first;
int y = q.front().second;
q.pop();
for(int i = 0; i < 4; i++)
{
int nxt_x = x + dir[i][0];
int nxt_y = y + dir[i][1];
if(nxt_x >= 0 && nxt_x < n
&& nxt_y >= 0 && nxt_y < m
&& grid[nxt_x][nxt_y] == '#' && !vis[nxt_x][nxt_y])
{
vis[nxt_x][nxt_y] = 1;
q.push(pii(nxt_x, nxt_y));
cost[nxt_x][nxt_y] = cost[x][y] + 1;
}
}
}
get_ans();
}
int main()
{
int T, Case = 0;
cin >> T;
while(T--)
{
min_cost = INF;
cin >> n >> m;
for(int i = 0; i < n; i++)
for(int j = 0; j < m; j++)
cin >> grid[i][j];
for(int i = 0; i < n; i++)
for(int j = 0; j < m; j++)
for(int p = 0; p < n; p++)
for(int q = 0; q < m; q++)
if(grid[i][j] == '#' && grid[p][q] == '#')
bfs(i, j, p, q);
printf("Case %d: ",++Case);
printf("%d\n",min_cost == INF ? -1 : min_cost);
}
return 0;
}