Submission #1884075

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

const int N=1e5+10;
int n;
int v[N][2],w[N];

int gr[N];
bool comp(int x,int y){
        return w[x]>w[y];
}
ll f[N];
ll fcom[N];
int p[N];
vector <int> imp[N];
int main(){
        cin>>n;
        for(int i=1;i<n;i++)
                cin>>v[i][0]>>v[i][1]>>w[i];
        for(int i=1;i<n;i++) p[i]=i;
        sort(p+1,p+n,comp);
        

        for(int i=1;i<=n;i++){
                gr[i]=i;
                imp[i].push_back(i);
        }

        for(int i=1;i<n;i++){
                int use=p[i];
                int x=gr[v[use][0]],y=gr[v[use][1]];
                if (imp[x].size()>imp[y].size()) swap(x,y);
                fcom[x]+=1LL*imp[y].size()*w[use];
                fcom[y]+=1LL*imp[x].size()*w[use];
                for(auto per:imp[x]){
                        f[per]+=fcom[x]-fcom[y];
                        gr[per]=y;
                        imp[y].push_back(per);
                }
        }
        for(int i=1;i<=n;i++) cout<<f[i]+fcom[gr[i]]<<"\n";
}

Submission Info

Judge Result