# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1056186 | Gangsta | 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 <bits/stdc++.h>
#define ll long long int
#define pb push_back
using namespace std;
vector<ll> minimum_closure_costs(int n, vector<int> u, vector<int> v, vector<int> w){
vector <ll> s, ans;
bool tr = 0;
ll sum = 0, san = 0, sm = 0, sm1 = 0;
for(int i = 0; i < n-1; i++){
if(w[i]) tr = 1;
if(i % 2) sm += w[i];
else sm1 += w[i];
s.pb(w[i]);
sum += w[i];
}
if(tr){
for(int i = 0; i < n; i++){
if(i == 0) ans.pb(sum);
else if(i == 1) ans.pb(min(sm,sm1));
else ans.pb(0);
}
}
else{
sort(s.rbegin(), s.rend());
ans.pb(sum);
for(auto i: s){
san += i;
ans.pb(sum-san);
}
}
return ans;
}
int main(){
int n;
cin >> n;
vector <int> u, v, w;
for(int i = 0; i < n-1; i++){
int x, y, z;
cin >> x >> y >> z;
u.pb(x);
v.pb(y);
w.pb(z);
}
for(auto i: minimum_closure_costs(n, u, v, w)) cout << i << ' ';
}