Submission #1005416

#	Time	Username	Problem	Language	Result	Execution time	Memory
1005416		0npata	Road Closures (APIO21_roads)	C++17	0 / 100	88 ms	68936 KiB

roads

#include "roads.h"

#include<bits/stdc++.h>
using namespace std;

#define vec vector
#define int long long

const int MXN = 2'005;
vec<pair<int, int>> tree[MXN];
int dp[MXN][MXN];

void dfs(int u, int p = -1) {
	for(auto [v, w] : tree[u]) {
		if(v == p) continue;

		dfs(v, u);
	}

	for(int k = 1; k<MXN; k++) {
		vec<int> ext(0);
		for(auto [v, w] : tree[u]) {
			if(v == p) continue;

			dp[u][k] += dp[v][k];
			ext.push_back(w + dp[v][k-1] - dp[v][k]);
		}

		sort(ext.begin(), ext.end(), greater<int>());

		for(int i = 0; i<min((int) ext.size(), k); i++) {
			if(ext[i] > 0) dp[u][k] += ext[i];
		}
	}
}

std::vector<int> minimum_closure_costs(int32_t n, std::vector<int32_t> u,
                                             std::vector<int32_t> v,
                                             std::vector<int32_t> w) {
	for(int i = 0; i<MXN; i++) {
		tree[i] = {};
		for(int j = 0; j<MXN; j++) {
			dp[i][j] = 0;
		}
	}
	int sumw = 0;
	for(int i = 0; i<n-1; i++) {
		tree[u[i]].push_back({v[i], w[i]});
		tree[v[i]].push_back({u[i], w[i]});
		sumw += w[i];
	}

	dfs(0);

	vec<int> ans(n);
	for(int i = 0; i<n; i++) {
		ans[i] = sumw - dp[0][i];
	}
	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