DSU_on_trees.cpp

#include <cstdio>
#include <iostream>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <math.h>
#include <cmath>
#include <string>
#include <iomanip>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <bitset>
#include <unordered_map>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
using namespace std;

#define inf 1013161010
#define ninf -1013161010
#define mod 1000000007
#define ll long long
#define lf long double
#define in(x) scanf("%d",&x);
#define sz(x) ((int)x.size())
#define lld l64d
#define rep(i,n) for(i=0;i<n;i++)
#define rrep(i,n) for(i=n-1;i>=0;i--)
#define rep1(i,a,b) for(i=a;i<=b;i++)
#define rrep1(i,a,b) for(i=a;i>=b;i--)
#define stlfor(i,t) for(auto i =t.begin();i!=t.end();i++)
#define fr freopen("x.txt","r",stdin)
#define frc freopen("y.txt","w",stdout)
#define all(x) x.begin(),x.end()
#define set0(x) memset(x,0,sizeof(x))
#define dbg cout<<"yo "<<endl;
#define pset(n) fixed<<showpoint<<setprecision(n)

#define pii pair<int,int>
#define pll pair<ll,ll>
#define vpii vector<pair<int,int> >
#define vpll vector<pair<ll,ll> >
#define si set<int>
#define mii map<int,int>
#define umii unordered_map<int,int>
#define vi vector<int>
#define pb push_back
#define ff first
#define ss second
#define mp make_pair

typedef tree<pii,null_type,less<pii>,rb_tree_tag,tree_order_statistics_node_update> OST;

ll toint(const string &s) { stringstream ss; ss << s; ll x; ss >> x; return x; }
string tostring ( ll number ){  stringstream ss; ss<< number; return ss.str();}

const lf pi = 2*acos(0);
const int nn = 2000006;
const lf EPS = 0.000000001;

ll gcd(ll a,ll b){return (b==0)? a:gcd(b,a%b); }
void nope(int num = 0){ if(num==0) cout<<"NO"; else cout<<"-1"; exit(0); }

// also refer : http://codeforces.com/contest/600/submission/22799022
// LOMSAT GELRAL

set<ll> cnt[100010];
vpll g[100010];
ll ans[100010], use[100010];
ll ret[100010], a[100010];

ll dfs(int node, int p)
{
    int i;
    int mx=-1, bc=-1;
    for(auto u: g[node])
    {
        if(u.ff!=p)
        {
            ret[u.ff] = dfs(u.ff, node) + u.ss;
            if((int)cnt[use[u.ff]].size()>mx)
            {
                mx=(int) cnt[use[u.ff]].size();
                bc=u.ff;
            }
        }
    }

    if(mx!=-1)
    {
        use[node]=use[bc];
        cnt[use[node]].insert(a[node]-ret[bc]);

        for(auto u: g[node])
        {
            if(u.ff!=p&&u.ff!=bc)
            {
                for(auto x: cnt[use[u.ff]])
                {
                    cnt[use[node]].insert(x+ret[u.ff]-ret[bc]);
                }
            }
        }
        ans[node]=(ll)sz(cnt[use[node]]);
    }
    else
    {
        cnt[use[node]].insert(a[node]);
        ans[node]=1;
    }
    return ret[bc];
}


int main()
{
    ios_base::sync_with_stdio(false); cin.tie(0);
    ll i,j,n,tt;
    tt=1;
    //cin>>tt;
    while(tt--)
    {



    }
    return 0;
}