Submission #722426

#TimeUsernameProblemLanguageResultExecution timeMemory
722426grossly_overconfidentRoad Closures (APIO21_roads)C++17
5 / 100
50 ms5524 KiB
#include <bits/stdc++.h> using namespace std; #define endl '\n' //#define int long long //#define INT_MAX LONG_LONG_MAX vector<long long> minimum_closure_costs(int n, vector<int> u, vector<int> v, vector<int> w){ sort(w.begin(), w.end()); vector<long long> out(n); int j = 0; for (int i = n - 2; i >= 0; --i){ out[i] = out[i + 1] + w[j]; j++; } return out; }
#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...