Submission #570222

#TimeUsernameProblemLanguageResultExecution timeMemory
570222thatsgonzalezRoad Closures (APIO21_roads)C++14
5 / 100
53 ms3644 KiB
#include "roads.h" using namespace std; #include <bits/stdc++.h> #include <vector> std::vector<long long> minimum_closure_costs(int N, std::vector<int> U, std::vector<int> V,std::vector<int> W) { std::vector <long long> ans(N,0); long long res=0; for(auto &x: W) res+=x; sort(W.begin(),W.end(),greater<int>()); ans[0]=res; for(int i=0; i<N-1; i++){ res-=W[i]; ans[i+1]=res; } 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...