Fire！（多源BFS）

Fire！

link

思路

跑两遍bfs ，第一遍跑火，得到被烧的时间， 以此跑第二遍人的bfs

##AC代码

#include <bits/stdc++.h>
#define inf 0x3f3f3f3f
//#define int long long
using namespace std;
typedef pair<int, int> PII;
const int N = 10 + 1e3, mod = 1e9 + 7;
int n, m;
char g[N][N];
int Time[N][N];
int dx[4] = {0, 0, -1, 1}, dy[4] = {-1, 1, 0, 0};
bool vis[N][N];
struct node
{
    int x, y, t;
};
queue<node> q, p;

void get_Time()
{
    while (q.size())
    {
        node st = q.front();
        q.pop();
        Time[st.x][st.y] = st.t;

        for (int i = 0; i < 4; i++)
        {
            int nx = st.x + dx[i], ny = st.y + dy[i];
            if (nx < 0 || ny < 0 || nx >= n || ny >= m || vis[nx][ny] || g[nx][ny] == '#')
                continue;
            vis[nx][ny] = 1;
            q.push({nx, ny, st.t + 1});
        }
    }
}
int bfs(node st)
{
    int ans = inf;
    q.push(st);
    vis[st.x][st.y] = 1;
    while (q.size())
    {
        node s = q.front();
        q.pop();

        for (int i = 0; i < 4; i++)
        {
            int nx = s.x + dx[i], ny = s.y + dy[i];
            if (nx < 0 || ny < 0 || nx >= n || ny >= m)
                ans = min(ans, s.t + 1);
            if (nx < 0 || ny < 0 || nx >= n || ny >= m || vis[nx][ny] || Time[nx][ny] <= s.t + 1 || g[nx][ny] == '#')
                continue;

            q.push({nx, ny, s.t + 1});
            vis[nx][ny] = 1;
        }
    }
    return ans;
}
void init(int op)
{
    if (op == 0)
        memset(Time, 0x3f, sizeof Time);
    memset(vis, 0, sizeof vis);
    while (q.size())
        q.pop();
}
void solve()
{
    init(0);
    node st;
    cin >> n >> m;
    for (int i = 0; i < n; i++)
        for (int j = 0; j < m; j++)
        {
            cin >> g[i][j];
            if (g[i][j] == 'F')
                vis[i][j] = 1, q.push({i, j, 0});
            else if (g[i][j] == 'J')
                st = {i, j, 0};
        }
    get_Time();
    init(1);
    int ans = bfs(st);
    if (ans == inf)
        cout << "IMPOSSIBLE\n";
    else
        cout << ans << endl;
}
signed main()
{
    ios::sync_with_stdio();

    int T;
    cin >> T;
    int T1 = clock();
    while (T--)
        solve();

    int T2 = clock();
    cerr << endl
         << " Time : " << T2 - T1 << "ms." << endl;
    return 0;
}