Submission #1350437

#TimeUsernameProblemLanguageResultExecution timeMemory
1350437SulARoad Closures (APIO21_roads)C++20
0 / 100
15 ms3340 KiB
#include <bits/stdc++.h>
using namespace std;

vector<long long> minimum_closure_costs(int n, vector<int> u, vector<int> v, vector<int> w) {
    vector<long long> ans(n);
    ranges::sort(w);
    for (int i = 0; i < n-1; i++)
        ans[i+1] = ans[i] + w[i];
    return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...