#include "roads.h"
#include <bits/stdc++.h>
using namespace std;
#define all(x) begin(x), end(x)
typedef long long ll;
const int N = 100001;
int A[N], B[N], W[N], n;
ll dp[N][2];
int k;
vector<pair<int, int>> g[N];
void dfs(int v, int p) {
vector<pair<int, int>> adj;
for (auto [to, w]: g[v]) {
if (to != p) {
dfs(to, v);
adj.emplace_back(to, w);
}
}
if (k > (int) size(adj)) {
vector<ll> nw;
ll ans = 0;
for (auto [to, w]: adj) {
ans += dp[to][0] + w;
nw.push_back(dp[to][1] - dp[to][0] - w);
}
sort(all(nw));
for (int i = 0; i < (int) size(nw); ++i) {
if (nw[i] < 0)
ans += nw[i];
}
dp[v][1] = dp[0][v] = ans;
} else {
vector<ll> nw;
ll ans = 0;
for (auto [to, w]: adj) {
ans += dp[to][0] + w;
nw.push_back(dp[to][1] - dp[to][0] - w);
}
sort(all(nw));
ll added = 0;
for (int i = 0; i < k - 1; ++i) {
if (nw[i] < 0)
added += nw[i];
}
dp[v][1] = ans + added;
added = 0;
for (int i = 0; i < k; ++i) {
added += nw[i];
}
dp[v][0] = min(dp[v][1], ans + added);
}
}
vector<ll> minimum_closure_costs(int nn, vector<int> uu, vector<int> vv, vector<int> ww) {
n = nn;
for (int i = 0; i < n - 1; ++i) {
A[i] = uu[i], B[i] = vv[i], W[i] = ww[i];
g[A[i]].emplace_back(B[i], W[i]);
g[B[i]].emplace_back(A[i], W[i]);
}
vector<ll> ans;
dfs(0, -1);
k = 0;
ans.push_back(dp[0][0]);
k = 1;
dfs(0, -1);
ans.push_back(dp[0][0]);
if (n > 2) {
k = 2;
dfs(0, -1);
for (int z = 2; z < n; ++z) {
ans.push_back(dp[0][0]);
}
}
return ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
2644 KB |
Output is correct |
2 |
Incorrect |
3 ms |
2900 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
2644 KB |
Output is correct |
2 |
Correct |
68 ms |
23656 KB |
Output is correct |
3 |
Correct |
78 ms |
26144 KB |
Output is correct |
4 |
Correct |
102 ms |
27596 KB |
Output is correct |
5 |
Correct |
81 ms |
27572 KB |
Output is correct |
6 |
Correct |
2 ms |
3028 KB |
Output is correct |
7 |
Correct |
3 ms |
3156 KB |
Output is correct |
8 |
Correct |
3 ms |
3028 KB |
Output is correct |
9 |
Correct |
2 ms |
2644 KB |
Output is correct |
10 |
Correct |
2 ms |
2644 KB |
Output is correct |
11 |
Correct |
2 ms |
2644 KB |
Output is correct |
12 |
Correct |
49 ms |
17616 KB |
Output is correct |
13 |
Correct |
81 ms |
27648 KB |
Output is correct |
14 |
Correct |
1 ms |
2644 KB |
Output is correct |
15 |
Correct |
68 ms |
25312 KB |
Output is correct |
16 |
Correct |
78 ms |
27644 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
2644 KB |
Output is correct |
2 |
Incorrect |
2 ms |
2644 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
2644 KB |
Output is correct |
2 |
Incorrect |
2 ms |
2644 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
125 ms |
12404 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
125 ms |
12404 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
2644 KB |
Output is correct |
2 |
Incorrect |
3 ms |
2900 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |