Submission #1840713

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

typedef long long LL;
typedef pair<int , int> P2;
typedef pair<pair<int , int> , int> P3;
typedef pair<pair<int , int> , pair<int , int> > P4;
#define PB(a) push_back(a)
#define MP(a , b) make_pair((a) , (b))
#define M3P(a , b , c) make_pair(make_pair((a) , (b)) , (c))
#define M4P(a , b , c , d) make_pair(make_pair((a) , (b)) , make_pair((c) , (d)))
#define repp(i,a,b) for(int i = (int)(a) ; i < (int)(b) ; ++i)
#define repm(i,a,b) for(int i = (int)(a) ; i > (int)(b) ; --i)

const int MC = 100010;
int N;
tuple<LL,int,int> e[MC];
LL ans[MC];
LL potential[MC];
int group[MC];
vector<int> G[MC];

void uni(int a , int b){
	int x = group[a] , y = group[b];
	if(G[x].size() < G[y].size()) swap(x,y);
	for(auto u : G[y]){
		ans[u] += potential[y] - potential[x];
		G[x].PB(u);
		group[u] = x;
	}
}

int main(){
	cin >> N;
	repp(i,1,N+1){
		G[i].PB(i);
		group[i] = i;
	}
	repp(i,1,N){
		int a,b,c;
		cin >> a >> b >> c;
		e[i-1] = make_tuple(c,a,b);
	}
	sort(e,e+N-1);
	repm(i,N-2,-1){
		int a = get<1>(e[i]) , b = get<2>(e[i]) , c = get<0>(e[i]);
		potential[group[a]] += c * G[group[b]].size();
		potential[group[b]] += c * G[group[a]].size();
		uni(a,b);
	}
	repp(i,1,N+1) cout << ans[i] + potential[group[i]] << endl;
	return 0;
}

Submission Info

Judge Result