Submission #1202277

#TimeUsernameProblemLanguageResultExecution timeMemory
1202277jer033Road Closures (APIO21_roads)C++20
5 / 100
30 ms3968 KiB
#include "roads.h" #include <bits/stdc++.h> #include <vector> using namespace std; using ll = long long; std::vector<long long> minimum_closure_costs(int N, std::vector<int> U, std::vector<int> V, std::vector<int> W) { sort(W.begin(), W.end()); vector<ll> ans(N, 0); for (int i=0; i<(N-1); i++) ans[N-2-i] = ans[N-1-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...