题目链接:https://www.luogu.com.cn/problem/U41492
题意:给一棵根为1的树,每次询问子树颜色种类数
思路:树上启发式合并,每次计算时如果是第一次出现就计算贡献,轻链的话要消除贡献
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define ls rt << 1
#define rs rt << 1|1
#define po pop_back
#define pb push_back
#define mk make_pair
#define lson l, mid, ls
#define rson mid + 1, r, rs
#define pll pair<ll, ll>
#define pii pair<int, int>
#define ull unsigned long long
#define pdd pair<double, double>
const int mod = 1e9 + 9;
const int maxn = 2e5 + 10;
const int inf = 0x3f3f3f3f;
const ll linf = 0x3f3f3f3f3f3f3f3f;
int c[maxn], num[maxn], sz[maxn], son[maxn], sum[maxn], cnt[maxn], ans[maxn], Max, Son;
vector<int> e[maxn];
void dfs(int u, int fa) //统计重儿子信息
{
sz[u] = 1;
//sum[u] = num[u];
for(auto v : e[u])
{
i