Submission #1223444

#	Time	Username	Problem	Language	Result	Execution time	Memory
1223444		SpyrosAliv	Road Closures (APIO21_roads)	C++20	0 / 100	543 ms	1114112 KiB

roads

//#include "roads.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long

const ll INF = 1e17;
vector<vector<pair<int, ll>>> tree;
vector<vector<ll>> dp;
int n;

void dfs(int node, int par = 0) {
    int ch = 0;
    dp[node][0] = 0;
    for (auto [next, w]: tree[node]) {
        if (next == par) continue;
        dfs(next, node);
        dp[node][0] += w + dp[next][0];
    }
    for (int k = 1; k < n; k++) {
        ll ans = 0;
        vector<ll> ops;
        for (auto [next, w]: tree[node]) {
            if (next == par) continue;
            ops.push_back(dp[next][k-1] - (dp[next][k] + w));
            ans += dp[next][k] + w;
        }
        sort(ops.begin(), ops.end());
        dp[node][k] = min(dp[node][k], ans);
        for (int j = 0; j < min((int)ops.size(), k); j++) {
            ans += ops[j];
            dp[node][k] = min(dp[node][k], ans);
        }
        dp[node][k] = min(dp[node][k], dp[node][k-1]);
    }
}

vector<ll> minimum_closure_costs(int N, vector<int> U, vector<int> V, vector<int> W) {
    n = N;
    tree.clear();
    tree.resize(n+1);
    for (int i = 0; i < n-1; i++) {
        U[i]++;
        V[i]++;
        tree[U[i]].push_back({V[i], W[i]});
        tree[V[i]].push_back({U[i], W[i]});
    }
    dp.assign(n+1, vector<ll>(n+1, INF));
    dfs(1);
    vector<ll> ans;
    for (int k = 0; k < n; k++) ans.push_back(dp[1][k]);
    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