# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
561013 | OrazB | Road Closures (APIO21_roads) | C++14 | 58 ms | 8188 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "roads.h"
#include <bits/stdc++.h>
#define N 100005
#define ll long long
#define pb push_back
using namespace std;
std::vector <ll> minimum_closure_costs(int n, std::vector<int> U,
std::vector<int> V,
std::vector<int> W) {
bool sub1 = 0;
vector <ll> v, ans;
for (int i = 0; i < n-1; i++){
if (U[i]) sub1 = 1;
// E[U[i]].pb({V[i], W[i]});
// E[V[i]].pb({U[i], W[i]});
v.pb(W[i]);
}
if (!sub1){
sort(v.begin(), v.end());
ll p[N];
p[0] = v[0];
for (int i = 1; i < v.size(); i++) p[i] = p[i - 1] + v[i];
for (int k = 0; k < n; k++) ans.pb(p[n - k - 2]);
return ans;
}
}
// int main(){
// int n;
// cin >> n;
// vector <int> U(N), V(N), W(N);
// for (int i = 0; i < n-1; i++) cin >> U[i] >> V[i] >> W[i];
// for (int i = 0; i < n; i++)
// cout << minimum_closure_costs(n, U, V, W)[i] << " ";
// }
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |