# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
569391 | Akiti | 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>
using namespace std;
using ll =long long;
struct edge
{
int a, b, c;
};
bool compaire(edge g, edge h)
{
return g.c > h.c;
}
vector <ll> minimum_closure_costs(int n, vector <int> u, vector <int> v, vector <int> w)
{
ll sum = 0;
ll m = u.size();
vector <edge> d(m);
vector <ll> t;
for (ll i = 0; i < m; i++)
{
sum+= w[i];
d[i].a = u[i];
d[i].b = v[i];
d[i].c = w[i];
}
sort(d.begin(), d.end(), compaire);
t.push_back(sum);
for (ll k = 0; k < m; k++)
{
sum-= d[k].c;
t.push_back(sum);
}
return t;
}
int main()
{
ll n;
cin>> n;
vector <int> u(n - 1), v(n - 1), w(n - 1);
for (ll i = 0; i < n - 1; i++)
{
cin>> u[i] >> v[i] >> w[i];
}
vector <ll> r;
r = minimum_closure_costs(n, u, v, w);
for (ll i = 0; i < r.size(); i++)
cout<< r[i] << ' ';
}