Submission #67574780

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
const int N = 1 << 18;
const int INF = 0x3f3f3f3f;
int f[N][20];
int vis[N][20];
int lft[N][20];
int g[N][20];
vector<int> G[N];
void solve() {
    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= n; i++) G[i].clear();
    for (int i = 1; i <= n; i++) {
        for (int j = 0; j < m; j++) {
            f[i][j] = -1;
            vis[i][j] = -1;
        }
    }
    for (int i = 1; i < n; i++) {
        int u, v;
        cin >> u >> v;
        G[u].push_back(v);
        G[v].push_back(u);
    }
    queue<pair<int, int>> q;
    q.push({1, 0});
    vis[1][0] = 0, f[1][0] = 0;
    while (!q.empty()) {
        auto [x, d] = q.front();
        q.pop();
        int v = f[x][d] + 1;
        if (d == 0) lft[x][d] = 0;
        if (x < 0) x = -x, lft[x][d] = 0, v = g[x][d] + 1;
        int Lft = lft[x][d];
        if (d == 0) d = m;
        for (auto y : G[x]) {
            if (y == Lft) continue;
            if (f[y][d - 1] == -1) {
                f[y][d - 1] = v;
                lft[y][d - 1] = vis[y][d - 1] = x;
                q.push({y, d - 1});
            } else if (vis[y][d - 1] && vis[y][d - 1] != x) {
                g[y][d - 1] = v;
                vis[y][d - 1] = 0;
                q.push({-y, d - 1});
            }
        }
    }
    for (int i = 2; i <= n; i++) {
        if (f[i][0] == -1) {
            cout << "-1 ";
        } else {
            cout << f[i][0] / m << " ";
        }
    }
    cout << "\n";
}
int main() {
    int _;
    cin >> _;
    while (_--) solve();
    return 0;
}

Submission Info

Judge Result