# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
587625 | M_W | Road Closures (APIO21_roads) | C++17 | 2080 ms | 25032 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define ii pair<long long, long long>
using namespace std;
vector<ii> adj[200002];
ii dfs(int a, int p, long long wt, int k){
long long sm = 0;
priority_queue<long long, vector<long long>, greater<long long>> pq;
for(auto [x, w]: adj[a]){
if(x == p) continue;
ii res = dfs(x, a, w, k);
sm += res.first;
pq.push(res.second - res.first);
}
while(!pq.empty() && pq.top() < 0){
sm += pq.top(); pq.pop();
}
while(pq.size() > k){
sm += pq.top(); pq.pop();
}
ii res2 = {sm, sm + wt};
if(a != 0 && !pq.empty() && pq.size() == k) res2.first += pq.top();
return res2;
}
vector<long long> minimum_closure_costs(int N, vector<int> U, vector<int> V, vector<int> W) {
for(int i = 0; i < N - 1; i++){
adj[U[i]].push_back({V[i], W[i]});
adj[V[i]].push_back({U[i], W[i]});
}
vector<long long> ans(N, 0);
for(int i = N - 1; i >= 0; i--){
ii res = dfs(0, 0, 0, i);
ans[i] = res.first;
}
return ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |