CodeForces 375D :Tree and Queries dsu on tree

传送门

题意

分析

树上静态统计，跟$dsuontree$的板子题处理出现次数最多的是一个思路，维护一下每一种颜色出现的次数即可

代码

#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 2e5 + 10,M = N * 2;
const ll mod = 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {
    char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}
    while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}
int h[N],ne[M],e[M],idx;
int a[N];
int sz[N],son[N],ans[N];
int Son;
int n,m;
struct Node{
   int u,id; 
};
vector<Node> q[N];
int res[N],sum[N];

void add(int x,int y){
    ne[idx] = h[x],e[idx] = y,h[x] = idx++;
}

void dfs(int u,int fa){
    sz[u] = 1;
    for(int i = h[u];~i;i = ne[i]){
        int j = e[i];
        if(j == fa) continue;
        dfs(j,u);
        sz[u] += sz[j];
        if(sz[son[u]] < sz[j]) son[u] = j;
    }
}

void cal(int u,int fa,int st){
    if(st == -1) res[sum[a[u]]] += st;
    sum[a[u]] += st;
    if(st == 1) res[sum[a[u]]] += st;
    for(int i = h[u];~i;i = ne[i]){
        int j = e[i];
        if(j == fa || j == Son) continue;
        cal(j,u,st);
    }
}

void dsu(int u,int fa,int st){
    for(int i = h[u];~i;i = ne[i]){
        int j = e[i];
        if(j == fa || j == son[u]) continue;
        dsu(j,u,0);
    }
    if(son[u]) dsu(son[u],u,1);
    Son = son[u];
    cal(u,fa,1);
    for(Node t:q[u]) ans[t.id] = res[t.u];
    Son = 0;
    if(!st) cal(u,fa,-1);
}

int main() {
    memset(h,-1,sizeof h);
    read(n),read(m);
    for(int i = 1;i <= n;i++) read(a[i]);
    for(int i = 1;i < n;i++){
        int x,y;
        read(x),read(y);
        add(x,y),add(y,x);
    }
    for(int i = 1;i <= m;i++){
        int x,y;
        read(x),read(y);
        q[x].pb({y,i});
    }
    dfs(1,0);
    dsu(1,0,0);
    for(int i = 1;i <= m;i++) di(ans[i]);
    return 0;
}