Submission #1177975

#TimeUsernameProblemLanguageResultExecution timeMemory
1177975JelalTkmRoad Closures (APIO21_roads)C++20
0 / 100
25 ms3396 KiB
#include <bits/stdc++.h> #include "roads.h" #pragma GCC optimize ("O3") #pragma GCC target ("sse4") using namespace std; #define ll long long int // const int N = 1000 + 10; // const int md = 1e9 + 7; // const int INF = 5e6; vector<ll> minimum_closure_costs(int n, vector<int> u, vector<int> v, vector<int> w) { vector<ll> ans(n, 0); sort(w.rbegin(), w.rend()); int sm = 0; for (int i = (n - 1); i >= 0; i--) { ans[i] = sm; if ((i - 1) >= 0) sm += w[i - 1]; } return ans; } // int32_t main(int32_t argc, char *argv[]) { // ios::sync_with_stdio(false); // cin.tie(nullptr); // int T = 1; // // cin >> T; // while (T--) { // vector<int> u = {0, 0, 0}, v = {1, 2, 3}, w = {5, 10, 5}; // vector<ll> ans = minimum_closure_costs(4, u, v, w); // for (auto i: ans) // cout << i << " "; // } // return 0; // }
#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...