点火游戏（bfs）

原题链接

解题思路：本题我们可以记录下所以草地的坐标，然后枚举一下两个起火点(可以是同一块草地)。然后bfs一遍，看是否能够点燃所有草地，如果能的话，记录一下最小值即可

C++代码

#include <bits/stdc++.h>
// #define int long long 
using namespace std;
typedef pair<int, int> PII;
const int N = 15;
char g[N][N];
int dist[N][N];
vector<PII> v;
int t, n, m;
int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};

int bfs(int i, int j)
{
    int maxn = 0;
    memset(dist, 0x3f, sizeof dist);
    queue<PII> q;
    q.push({v[i].first, v[i].second});
    q.push({v[j].first, v[j].second});
    dist[v[i].first][v[i].second] = 0;
    dist[v[j].first][v[j].second] = 0;
    while (q.size())
    {
        auto t = q.front();
        q.pop();
        int xx = t.first, yy = t.second;
        for (int i = 0; i < 4; i ++ )
        {
            int a = xx + dx[i], b = yy + dy[i];
            if (a >= 1 && a <= n && b >= 1 && b <= m && g[a][b] == '#' && dist[a][b] == 0x3f3f3f3f)
            {
                dist[a][b] = dist[xx][yy] + 1;
                maxn = max(maxn, dist[a][b]);
                q.push({a, b});
            }
        }
    }
    bool is_ok = true;
    for (int i = 1; i <= n; i ++ )
    {
        for (int j = 1; j <= m; j ++ )
        {
            if (g[i][j] == '#' && dist[i][j] == 0x3f3f3f3f) 
            {
                is_ok = false;
                break;
            }
        }
    }
    if (is_ok) return maxn;
    else return -1;
}

signed main()
{
    cin >> t; 
    for (int op = 1; op <= t; op ++ )
    {
        cout << "Case " << op << ": ";
        v.clear();
        cin >> n >> m;
        for (int i = 1; i <= n; i ++ ) cin >> g[i] + 1;
        for (int i = 1; i <= n; i ++ )
        {
            for (int j = 1; j <= m; j ++ )
            {
                if (g[i][j] == '#') v.push_back({i, j});
            }
        }
        if (v.size() == 0) 
        {
            cout << -1 << endl;
            continue;
        }
        int minn = 2e9;
        for (int i = 0; i < v.size(); i ++ )
        {
            for (int j = i; j < v.size(); j ++ )
            {
                int t = bfs(i, j);
                if (t == -1) continue;
                minn = min(minn, t);
            }
        }
        if (minn == 2e9) cout << -1 << endl;
        else cout << minn << endl;
    }
    return 0;
}

创作不易，大家可以在AcWing注册账号，参与一下AC之星计划，我的邀请码是MYRGS。对题解有任何疑问可以在评论区下面评论