# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1162429 | brinton | Road Closures (APIO21_roads) | C++20 | 40 ms | 3768 KiB |
#include "roads.h"
#include <bits/stdc++.h>
using namespace std;
vector<long long> minimum_closure_costs(int N, vector<int> U,vector<int> V,vector<int> W) {
// sub1
long long tot = 0;
for(auto &i:W)tot += i;
sort(W.rbegin(),W.rend());
vector<long long> ans(N);
ans[0] = tot;
for(int i = 1;i < N;i++){
ans[i] = ans[i-1]-W[i-1];
}
return ans;
}
#undef int
# | 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... |