Language: C++

#include<bits/stdc++.h>
//ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
//clock_t start=clock();clock_t end=clock();cout<<(double)(end-start)/CLOCKS_PER_SEC<<endl;
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;
typedef pair<int,int> pii;
typedef pair<pii,int> ppii;
typedef pair<int,pii> pipi;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> ppll;
typedef pair<ll,pll> plpl;
typedef pair<pii,pii> P;
typedef tuple<ll,ll,ll> tl;
typedef pair<double,double> pdd;
typedef vector<vector<ll>> mat;
ll mod=1000000007;
ll mod2=998244353;
ll mod3=1000003;
ll mod4=998244853;
ll mod5=1000000009;
ll inf=1LL<<62;
double pi=3.141592653589793238462643383279L;
double eps=1e-14;
#define rep(i,m,n) for(ll i=m;i<n;i++)
#define rrep(i,n,m) for(ll i=n;i>=m;i--)
#define srep(itr,st) for(auto itr=st.begin();itr!=st.end();itr++)
#define mrep(itr,mp) for(auto& itr:mp)
#define Max(a,b) a=max(a,b)
#define Min(a,b) a=min(a,b)
int dh[4]={1,-1,0,0};
int dw[4]={0,0,1,-1};
int ddh[8]={-1,-1,-1,0,0,1,1,1};
int ddw[8]={-1,0,1,-1,1,-1,0,1};
struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        // http://xorshift.di.unimi.it/splitmix64.c
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};
#define umh unordered_map<ll,ll,custom_hash>
ll gcd(ll a,ll b){
    if(a<b)swap(a,b);
    if(b==0)return a;
    if(a%b==0)return b;
    return gcd(b,a%b);
}
ll lcm(ll a,ll b){
    ll c=gcd(a,b);
    return a*b/c;
}
ll Pow(ll n,ll k){
    ll ret=1;
    ll now=n;
    while(k>0){
        if(k&1)ret*=now;
        now*=now;
        k/=2;
    }
    return ret;
}
ll beki(ll n,ll k,ll md){
  ll ret=1;
  ll now=n;
    now%=md;
  while(k>0){
    if(k%2==1){
      ret*=now;
      ret%=md;
    }
    now*=now;
    now%=md;
    k/=2;
  }
  return ret;
}
ll gyaku(ll n,ll md){
  return beki(n,md-2,md);
}
ll popcount(ll n){
    ll ret=0;
    ll u=n;
    while(u>0){
        ret+=u%2;
        u/=2;
        
    }
    return ret;
}

int main(){
    ios::sync_with_stdio(false);cin.tie(0);
    ll n;cin>>n;
    int c[200000];
    rep(i,0,n){cin>>c[i];c[i]--;}
    vector<int> v[200000];
    rep(i,0,n-1){
        int a,b;cin>>a>>b;
        a--;
        b--;
        v[a].push_back(b);
        v[b].push_back(a);
    }
    ll ans[n];
    fill(ans,ans+n,n*(n+1)/2);
    ll cnt[n];
    fill(cnt,cnt+n,0);
    vector<map<ll,ll>> dp(n);
    auto dfs = [&](auto&& dfs,int i,int p)->void{
        for(int ne:v[i]){
            if(ne!=p){
                dfs(dfs,ne,i);
                cnt[i]+=cnt[ne];
                ll gg=cnt[ne];
                if(dp[ne].count(c[i]))gg-=dp[ne][c[i]];
               // cout<<i<<" "<<g<<endl;
                ans[c[i]]-=gg*(gg+1)/2;
                if(dp[i].size()<dp[ne].size())swap(dp[i],dp[ne]);
                for(auto& p:dp[ne])dp[i][p.first]+=p.second;
            }
        }
        cnt[i]++;
        dp[i][c[i]]=cnt[i];
    };
    dfs(dfs,0,-1);
    //rep(i,0,n)cout<<dp[0][i]<<" ";
    //cout<<endl;
    rep(i,0,n){
        ll sa=n-dp[0][i];
        ans[i]-=sa*(sa+1)/2;
        cout<<ans[i]<<endl;
    }
}


Compiler output:
a.cc: In function 'int main()':
a.cc:118:16: error: use of deleted function 'main()::<lambda(auto:28&&, int, int)>::~<lambda>()'
  118 |     auto dfs = [&](auto&& dfs,int i,int p)->void{
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  119 |         for(int ne:v[i]){
      |         ~~~~~~~~~~~~~~~~~
  120 |             if(ne!=p){
      |             ~~~~~~~~~~
  121 |                 dfs(dfs,ne,i);
      |                 ~~~~~~~~~~~~~~
  122 |                 cnt[i]+=cnt[ne];
      |                 ~~~~~~~~~~~~~~~~
  123 |                 ll gg=cnt[ne];
      |                 ~~~~~~~~~~~~~~
  124 |                 if(dp[ne].count(c[i]))gg-=dp[ne][c[i]];
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  125 |                // cout<<i<<" "<<g<<endl;
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~
  126 |                 ans[c[i]]-=gg*(gg+1)/2;
      |                 ~~~~~~~~~~~~~~~~~~~~~~~
  127 |                 if(dp[i].size()<dp[ne].size())swap(dp[i],dp[ne]);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  128 |                 for(auto& p:dp[ne])dp[i][p.first]+=p.second;
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  129 |             }
      |             ~   
  130 |         }
      |         ~       
  131 |         cnt[i]++;
      |         ~~~~~~~~~
  132 |         dp[i][c[i]]=cnt[i];
      |         ~~~~~~~~~~~~~~~~~~~
  133 |     };
      |     ~           
a.cc:118:18: note: 'main()::<lambda(auto:28&&, int, int)>::~<lambda>()' is implicitly deleted because the default definition would be ill-formed:
  118 |     auto dfs = [&](auto&& dfs,int i,int p)->void{
      |                  ^