Submission #1072838

#	Time	Username	Problem	Language	Result	Execution time	Memory
1072838		stdfloat	Road Closures (APIO21_roads)	C++17	0 / 100	2084 ms	24200 KiB

roads

#include <bits/stdc++.h>
#include "roads.h"
// #include "grader.cpp"
using namespace std;

using ll = long long;

#define ff  first
#define ss  second
#define pii pair<int, int>

vector<vector<ll>> dp;

vector<vector<pii>> E;

void dfs(int x, int k, bool f, int p = -1) {
    if (dp[x][f] == LLONG_MAX) dp[x][f] = 0;
    else return;

    vector<ll> v;
    for (auto [i, w] : E[x]) {
        if (i == p) {
            if (f == 1) dp[x][f] += w;
            continue;
        }

        dfs(i, k, 0, x);
        dfs(i, k, 1, x);

        dp[x][f] += dp[i][0];
        v.push_back(dp[i][1] - dp[i][0]);
    }

    sort(v.begin(), v.end());

    for (int i = 0; i < (int)E[x].size() - k - f; i++) {
        dp[x][f] += v[i];
    }
}

vector<ll> minimum_closure_costs(int n, vector<int> U, vector<int> V, vector<int> W) {
    E.assign(n, {});

    vector<ll> ans = {0};
    for (int i = 0; i < n - 1; i++) {
        ans[0] += W[i];
        E[U[i]].push_back({V[i], W[i]});
        E[V[i]].push_back({U[i], W[i]});
    }

    for (int i = 1; i < n; i++) {
        dp.assign(n, vector<ll>(2, LLONG_MAX));
        dfs(0, i, 0);
        ans.push_back(dp[0][0]);
    }

    return ans;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 7
• Subtask 3: 0 / 14
• Subtask 4: 0 / 10
• Subtask 5: 0 / 17
• Subtask 6: 0 / 25
• Subtask 7: 0 / 22