信号塔覆盖(Cell Phone Network G) 题解

思路分析

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

参考代码

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

const int INF = 100000000;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;
    if (!(cin >> n)) return 0;
    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);
    }
    vector<int> par(n + 1, 0), order;
    vector<bool> vis(n + 1, false);
    vis[1] = true;
    order.push_back(1);
    for (int idx = 0; idx < (int)order.size(); ++idx) {
        int u = order[idx];
        for (int v : adj[u]) {
            if (!vis[v]) {
                vis[v] = true;
                par[v] = u;
                order.push_back(v);
            }
        }
    }
    vector<int> dp0(n + 1, 0), dp1(n + 1, 0), dp2(n + 1, 0);
    for (int i = n - 1; i >= 0; --i) {
        int u = order[i];
        dp0[u] = 1;
        dp2[u] = 0;
        int extra = INF;
        for (int v : adj[u]) {
            if (v == par[u]) continue;
            int m01 = min(dp0[v], dp1[v]);
            dp0[u] += min(m01, dp2[v]);
            dp2[u] += m01;
            extra = min(extra, dp0[v] - m01);
        }
        dp1[u] = dp2[u] + extra;
    }
    cout << min(dp0[1], dp1[1]) << "\n";
    return 0;
}