Submission #1835652

---

Source Code Expand

#include<bits/stdc++.h>
#define debug(x) cout<<#x<<"="<<x<<endl
typedef long long ll;
using namespace std;
const int maxn = 200009;

int fa[maxn],siz[maxn],son[maxn][2];
struct line{int from,to,val;}a[maxn];
int n,tot;
ll ans[maxn],val[maxn];

inline int read()
{
	int x=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}

int find(int x){return fa[x]==x?x:fa[x]=find(fa[x]);}
bool cmp(const line &x,const line &y){return x.val>y.val;}

void dfs(int x)
{
	int L=son[x][0],R=son[x][1];
	if(L+R==0) return ;
	ans[L]=ans[R]=ans[x];
	ans[L]+=siz[R]*val[x];
	ans[R]+=siz[L]*val[x];
	dfs(L);dfs(R);
}

int main()
{
	n=read();tot=n;
	for(int i=1;i<=n;i++) siz[i]=1,fa[i]=i;
	for(int i=1;i<n;i++) a[i]=(line){read(),read(),read()};
	sort(a+1,a+n,cmp);
	for(int i=1;i<n;i++)
	{
		int x=find(a[i].from),y=find(a[i].to),z=a[i].val;
		tot++;fa[tot]=tot;siz[tot]=siz[x]+siz[y];val[tot]=z;
		fa[x]=fa[y]=tot;
		son[tot][0]=x;son[tot][1]=y;
	}
	dfs(tot);
	for(int i=1;i<=n;i++) printf("%lld\n",ans[i]);
	return 0;
}

Submission Info

Judge Result