Submission #1868189

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

const int N = 100005;

struct Edge {
	int u, v, w;

	Edge (int u, int v, int w) :
		u(u), v(v), w(w) {}

	bool operator < (const Edge& rhs) const {
		return w > rhs.w;
	}
};

int n, par[N];
long long res[N];
long long val[N];
vector<Edge> E;
vector<int> comp[N];

int find(int u) {
	return (u == par[u]) ? u : par[u] = find(par[u]);
}

void join(int u, int v, int w) {
	u = find(u), v = find(v);
	if (comp[u].size() > comp[v].size()) swap(u, v);
	int szu = comp[u].size(), szv = comp[v].size();
	val[v] += 1LL * szu * w;
	for (auto i : comp[u]) {
		res[i] += val[u] + 1LL * szv * w - val[v], comp[v].push_back(i);
	}
	val[u] = 0, comp[u].clear(), par[u] = v;
}

int main() {
	ios::sync_with_stdio(false);
	cin >> n;
	for (int i = 1; i <= n; ++i) {
		par[i] = i, comp[i].push_back(i);
	}
	for (int i = 1; i < n; ++i) {
		int u, v, w; cin >> u >> v >> w;
		E.push_back(Edge(u, v, w));
	}
	sort(E.begin(), E.end());
	for (auto i : E) join(i.u, i.v, i.w);
	for (int i = 1; i <= n; ++i) {
		res[i] += val[find(i)]; cout << res[i] << '\n';
	}
}

Submission Info

Judge Result