# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
727088 | iskhakkutbilim | Road Closures (APIO21_roads) | C++14 | 0 ms | 0 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>
using namespace std;
#define ff first
#define ss second
vector<long long> minimum_closure_costs(int N, vector<int> U, vector<int> V, vector<int> W) {
vector<long long> ans;
int sub1 = 1, sub2 = 1;
for(int i = 0;i < N-1; i++){
if(U[i] != 0) sub1 = 0;
if(U[i] != i or V[i] != i+1) sub2 = 0;
}
int sum = 0;
for(int i = 0;i < N-1; i++) sum+= W[i];
ans.push_back(sum);
if(sub1){
sort(all(W[i]));
sum = 0;
for(int i = 0;i < N-1; i++){
sum+= W[i];
}
for(int i = N-2; i >= 0; i--){
sum-= W[i];
ans.push_back(sum);
}
}else if(sub2){
}else{
}
return ans;
}