松鼠的新家(Squirrel's New Home) 题解

思路分析

按题目要求使用对应数据结构与算法模拟/递推求解，注意数据范围边界与时间复杂度。

参考代码

#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;
    if (!(cin >> n)) return 0;
    vector<int> a(n);
    for (int i = 0; i < n; ++i) cin >> a[i];
    vector<vector<int>> adj(n + 1);
    for (int i = 1; i < n; ++i) {
        int u, v;
        cin >> u >> v;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    const int LOG = 19;
    vector<vector<int>> up(LOG, vector<int>(n + 1, 0));
    vector<int> dep(n + 1, 0), order;
    order.reserve(n);
    queue<int> q;
    dep[1] = 1;
    q.push(1);
    while (!q.empty()) {
        int u = q.front();
        q.pop();
        order.push_back(u);
        for (int v : adj[u]) {
            if (!dep[v]) {
                dep[v] = dep[u] + 1;
                up[0][v] = u;
                q.push(v);
            }
        }
    }
    for (int k = 1; k < LOG; ++k) {
        for (int i = 1; i <= n; ++i) {
            up[k][i] = up[k - 1][up[k - 1][i]];
        }
    }
    auto lca = [&](int u, int v) {
        if (dep[u] < dep[v]) swap(u, v);
        int d = dep[u] - dep[v];
        for (int k = 0; k < LOG; ++k) {
            if ((d >> k) & 1) u = up[k][u];
        }
        if (u == v) return u;
        for (int k = LOG - 1; k >= 0; --k) {
            if (up[k][u] != up[k][v]) {
                u = up[k][u];
                v = up[k][v];
            }
        }
        return up[0][u];
    };
    vector<int> diff(n + 1, 0);
    for (int i = 0; i < n - 1; ++i) {
        int u = a[i], v = a[i + 1];
        int l = lca(u, v);
        diff[u]++;
        diff[v]++;
        diff[l]--;
        if (up[0][l]) diff[up[0][l]]--;
    }
    for (int i = n - 1; i >= 0; --i) {
        int u = order[i];
        if (up[0][u]) diff[up[0][u]] += diff[u];
    }
    for (int i = 1; i < n; ++i) diff[a[i]]--;
    for (int i = 1; i <= n; ++i) cout << diff[i] << "\n";
    return 0;
}