Submission #1223424

#TimeUsernameProblemLanguageResultExecution timeMemory
1223424sokratisiRoad Closures (APIO21_roads)C++20
5 / 100
39 ms9520 KiB
#include "roads.h" #include <vector> #include <algorithm> using namespace std; vector<vector<int>> adj; vector<long long> minimum_closure_costs(int n, vector<int> u, vector<int> v, vector<int> w) { adj.resize(n+1); for (int i = 0; i < n-1; i++) { adj[u[i]].push_back(v[i]); adj[v[i]].push_back(u[i]); } vector<long long> ans(n); sort(w.begin(), w.end()); ans[n-1] = 0; for (int i = n-2; i >= 0; i--) { ans[i] = ans[i+1] + 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...