Submission #570123

#TimeUsernameProblemLanguageResultExecution timeMemory
570123Garguy22Road Closures (APIO21_roads)C++17
0 / 100
42 ms3612 KiB
#include <bits/stdc++.h> #include <vector> #include <algorithm> using namespace std; typedef long long ll; typedef vector<int> vi; typedef vector<ll> vl; #define pb push_back vl minimum_closure_costs(int N, vi U, vi V, vi W){ ll temp = 0; vl ans; sort(W.begin(), W.end()); ans.pb(0); for(int i = 0; i < N; i++){ temp += W[i]; ans.pb(temp); } reverse(ans.begin(), ans.end()); 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...