Codeforces 570D dsu on tree

题意

传送门 Codeforces 570D Tree Requests

题解

在每棵子树上，若能知道深度为 $d$ 的节点集中字母 $c$ 的数量 $cnt[d][c]$，那么根据回文的对称性，若数量为奇数的字母个数若不大于 $1$，则可构成回文；反之，则不能。

$dsuontree$ 统计 $cnt[d][c]$，同时求解当前子树上的查询的答案。总时间复杂度 $O(N\log N+26M)$。

#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
const int maxn = 500005;
int N, M, col[maxn], sz[maxn], dep[maxn];
int tot, head[maxn], to[maxn], nxt[maxn];
int cnt[maxn][26];
vector<P> Q[maxn];
bool res[maxn], hv[maxn];

void add_edge(int x, int y) { to[++tot] = y, nxt[tot] = head[x], head[x] = tot; }

void pdfs(int x, int d)
{
    sz[x] = 1, dep[x] = d;
    for (int i = head[x]; i; i = nxt[i])
    {
        int y = to[i];
        pdfs(y, d + 1), sz[x] += sz[y];
    }
}

void add(int x, int d)
{
    cnt[dep[x]][col[x]] += d;
    for (int i = head[x]; i; i = nxt[i])
    {
        int y = to[i];
        if (!hv[y])
            add(y, d);
    }
}

void dfs(int x, int keep)
{
    int mx = 0, hs = 0;
    for (int i = head[x]; i; i = nxt[i])
    {
        int y = to[i];
        if (sz[y] > mx)
            mx = sz[y], hs = y;
    }
    for (int i = head[x]; i; i = nxt[i])
    {
        int y = to[i];
        if (y != hs)
            dfs(y, 0);
    }
    if (hs)
        dfs(hs, 1), hv[hs] = 1;
    add(x, 1);
    for (auto &p : Q[x])
    {
        int d = p.first, k = p.second, odd = 0;
        for (int i = 0; i < 26; ++i)
            odd += cnt[d][i] & 1;
        res[k] = odd <= 1;
    }
    if (hs)
        hv[hs] = 0;
    if (!keep)
        add(x, -1);
}

int main()
{
    scanf("%d%d", &N, &M);
    for (int i = 2, p; i <= N; ++i)
        scanf("%d", &p), add_edge(p, i);
    for (int i = 1; i <= N; ++i)
    {
        char c;
        scanf(" %c", &c);
        col[i] = c - 'a';
    }
    for (int i = 1; i <= M; ++i)
    {
        int v, h;
        scanf("%d%d", &v, &h);
        Q[v].push_back(P(h, i));
    }
    pdfs(1, 1);
    dfs(1, 1);
    for (int i = 1; i <= M; ++i)
        puts(res[i] ? "Yes" : "No");
    return 0;
}