TsZr53 - Online C++0x Compiler & Debugging Tool

#include <bits/stdc++.h>

#define N int(2e5)

using namespace std;

int n,c[N+2],kq[N+2];

vector<int>adj[N+2];

set<int>luu[N+2];

void dfs(int u,int parent)

{

    luu[u].insert(c[u]);

    for(int i=0;i<adj[u].size();i++)

    {

        int v=adj[u][i];
        if(v==parent)
            continue;
        dfs(v,u);
        if(luu[u].size()<luu[v].size())
            swap(luu[u],luu[v]);
        for(int val:luu[v])
            luu[u].insert(val);
        luu[v].clear();
    }
    kq[u]=luu[u].size();
}
int main()
{
    cin>>n;
    for(int i=1;i<=n;i++)
        cin>>c[i];
    for(int i=1;i<n;i++)
    {
        int a,b;
        cin>>a>>b;
        adj[a].push_back(b);
        adj[b].push_back(a);
    }
    dfs(1,0);
    for(int i=1;i<=n;i++)
        cout<<kq[i]<<" ";
    return 0;
}