Submission #1872992

---

Source Code Expand

#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto (a): (b))
#define all(v) (v).begin(),(v).end()
#define len(v) (int)(v).size()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define cmx(x,y) x=max(x,y)
#define cmn(x,y) x=min(x,y)
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define spair(p) cout<<#p<<": "<<p.fi<<" "<<p.se<<endl
#define svec(v) cout<<#v<<":";rep(kbrni,v.size())cout<<" "<<v[kbrni];cout<<endl
#define sset(s) cout<<#s<<":";each(kbrni,s)cout<<" "<<kbrni;cout<<endl
#define smap(m) cout<<#m<<":";each(kbrni,m)cout<<" {"<<kbrni.first<<":"<<kbrni.second<<"}";cout<<endl

using namespace std;

typedef pair<int,int> P;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<double> vd;
typedef vector<P> vp;
typedef vector<string> vs;

const int MAX_N = 200005;

struct edge
{
    int from,to;
    ll cost;
    bool operator< (const edge& another) const {
        return cost > another.cost;
    }
};

struct eda
{
    int to;
    ll cost;
};

vector<eda> G[MAX_N];
int id;
int nw[MAX_N];

class UF {
private:
    int sz; vector<int> par,nrank,size;
public:
    UF(){}
    UF(int node_size){ sz = node_size; par.resize(sz),nrank.resize(sz),size.resize(sz);
        rep(i,sz){ par[i] = i; nrank[i] = 0; size[i] = 1;} }
    int find(int x){ if(par[x] == x){ return x; }else{ return par[x] = find(par[x]); } }
    void unite(int x,int y,ll cost){
        x = find(x),y = find(y);
        if(x == y) return;
        if(nrank[x] < nrank[y]) swap(x,y);
        ++id;
        G[id].pb((eda){nw[x],cost*size[y]}),G[id].pb((eda){nw[y],cost*size[x]});
        nw[x] = id;
        par[y] = x; size[x] += size[y];
        if(nrank[x] == nrank[y]) nrank[x]++;
    }
    int query(int x){ x = find(x); return size[x]; }
    bool same(int x,int y){ return find(x) == find(y); }
};

ll sm[MAX_N];

void dfs(int u,ll dist){
    sm[u] = dist;
    rep(i,len(G[u])){
        dfs(G[u][i].to,dist+G[u][i].cost);
    }
}

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n;
    cin >> n;
    vector<edge> vec(n-1);
    rep(i,n-1){
        int a,b,c;
        cin >> a >> b >> c;
        vec[i] = (edge){a-1,b-1,c};
    }
    sort(all(vec));
    rep(i,n){
        nw[i] = i;
    }
    id = n-1;
    UF uf(n);
    rep(i,n-1){
        uf.unite(vec[i].from,vec[i].to,vec[i].cost);
    }
    dfs(id,0);
    rep(i,n){
        cout << sm[i] << "\n";
    }
    return 0;
}

Submission Info

Judge Result