#include "roads.h"
#include <bits/stdc++.h>
using namespace std;
#define all(x) begin(x), end(x)
typedef long long ll;
const int N = 2001;
int A[N], B[N], W[N], n;
ll dp[N][N];
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);
}
}
for (int k = 0; k < n; ++k) {
if (k > size(adj)) {
dp[v][k] = dp[v][k - 1];
continue;
}
vector<ll> nw;
ll ans = 0;
for (auto [to, w] : adj) {
ans += dp[to][k] + w;
if (k) {
nw.push_back(dp[to][k - 1] - dp[to][k] - w);
}
}
sort(all(nw));
for (int i = 0; i < k; ++i) {
ans += nw[i];
}
dp[v][k] = ans;
if (k) {
dp[v][k] = min(dp[v][k], dp[v][k - 1]);
}
}
}
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);
for (int i = 0; i < n; ++i) {
ans.push_back(dp[0][i]);
}
return ans;
}
Compilation message
roads.cpp: In function 'void dfs(int, int)':
roads.cpp:25:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
25 | if (k > size(adj)) {
| ~~^~~~~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Correct |
169 ms |
30024 KB |
Output is correct |
3 |
Correct |
197 ms |
31896 KB |
Output is correct |
4 |
Correct |
100 ms |
31828 KB |
Output is correct |
5 |
Correct |
1 ms |
980 KB |
Output is correct |
6 |
Correct |
2 ms |
1492 KB |
Output is correct |
7 |
Correct |
2 ms |
1504 KB |
Output is correct |
8 |
Correct |
79 ms |
26872 KB |
Output is correct |
9 |
Correct |
134 ms |
31996 KB |
Output is correct |
10 |
Correct |
3 ms |
1364 KB |
Output is correct |
11 |
Correct |
2 ms |
1508 KB |
Output is correct |
12 |
Runtime error |
20 ms |
7244 KB |
Execution killed with signal 11 |
13 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
340 KB |
Output is correct |
2 |
Runtime error |
33 ms |
6816 KB |
Execution killed with signal 11 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Correct |
1 ms |
340 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Incorrect |
1 ms |
1108 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Correct |
1 ms |
340 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Incorrect |
1 ms |
1108 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
33 ms |
11612 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
33 ms |
11612 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Correct |
169 ms |
30024 KB |
Output is correct |
3 |
Correct |
197 ms |
31896 KB |
Output is correct |
4 |
Correct |
100 ms |
31828 KB |
Output is correct |
5 |
Correct |
1 ms |
980 KB |
Output is correct |
6 |
Correct |
2 ms |
1492 KB |
Output is correct |
7 |
Correct |
2 ms |
1504 KB |
Output is correct |
8 |
Correct |
79 ms |
26872 KB |
Output is correct |
9 |
Correct |
134 ms |
31996 KB |
Output is correct |
10 |
Correct |
3 ms |
1364 KB |
Output is correct |
11 |
Correct |
2 ms |
1508 KB |
Output is correct |
12 |
Runtime error |
20 ms |
7244 KB |
Execution killed with signal 11 |
13 |
Halted |
0 ms |
0 KB |
- |