Submission #804555

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