Submission #1177994

#TimeUsernameProblemLanguageResultExecution timeMemory
1177994stdfloatRoad Closures (APIO21_roads)C++20
5 / 100
30 ms3772 KiB
#include <bits/stdc++.h> #include "roads.h" // #include "grader.cpp" using namespace std; using ll = long long; vector<ll> minimum_closure_costs(int n, vector<int> U, vector<int> V, vector<int> W) { sort(W.begin(), W.end()); vector<ll> p(n); for (int i = 1; i < n; i++) p[i] = p[i - 1] + W[i - 1]; reverse(p.begin(), p.end()); return p; }
#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...