Submission #2169999

---

Source Code Expand

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


struct QuickFind{
  Int n;
  vector<Int> r,p,dat,laz;
  vector<vector<Int> > v;
  QuickFind(){}
  QuickFind(Int sz):n(sz),r(sz),p(sz),dat(n,0),laz(n,0),v(sz){
    for(Int i=0;i<n;i++){
      r[i]=1,p[i]=i;
      v[i].resize(1,i);
    }
  }
  bool same(Int x,Int y){
    return p[x]==p[y];
  }
  void unite(Int x,Int y,Int w){
    x=p[x];y=p[y];
    if(x==y) return;
    if(r[x]<r[y]) swap(x,y);
    //cout<<x<<" "<<r[x]<<":"<<y<<" "<<r[y]<<":"<<w<<endl;
    for(Int i=0;i<(Int)v[y].size();i++){
      p[v[y][i]]=x;
      v[x].push_back(v[y][i]);
      dat[v[y][i]]-=laz[x];
      dat[v[y][i]]+=laz[y];
      dat[v[y][i]]+=(r[x]-r[y])*w;
    }
    laz[x]+=r[y]*w;
    r[x]+=r[y];
    v[y].clear();
    laz[y]=0;
  }
  Int get(Int x){
    //cout<<x<<" "<<dat[x]<<" "<<laz[p[x]]<<endl;
    return dat[x]+laz[p[x]];
  }
};

//INSERT ABOVE HERE
signed main(){
  Int n;
  cin>>n;
  using T = tuple<Int, Int, Int>;
  vector<T> v;
  for(Int i=1;i<n;i++){
    Int a,b,c;
    cin>>a>>b>>c;
    v.emplace_back(c,--a,--b);
  }
  sort(v.rbegin(),v.rend());
  QuickFind uf(n);
  for(Int i=1;i<n;i++){
    Int c,a,b;
    tie(c,a,b)=v[i-1];
    uf.unite(a,b,c);
  }
  for(Int i=0;i<n;i++) cout<<uf.get(i)<<endl;
  return 0;
}

Submission Info

Judge Result