func_code_string: #include <bits/stdc++.h>   using namespace std;   constexpr int maxn = 120000;   int p[maxn], sz[maxn], top[maxn], hs[maxn], dfn[maxn], ssz[maxn];   namespace segtree {   bool marked[maxn << 2];   int sum[maxn << 2], mss[maxn << 2];   void push_down(int v, int tl, int tr) {     if (marked[v]) {       sum[(v << 1)] = -(((tl + tr) >> 1) - tl + 1);       sum[(v << 1 | 1)] = -(tr - ((tl + tr) >> 1));       mss[(v << 1)] = mss[(v << 1 | 1)] = -1;       marked[(v << 1)] = marked[(v << 1 | 1)] = true;       marked[v] = false;     }   }   void push_up(int v) {     sum[v] = sum[(v << 1)] + sum[(v << 1 | 1)];     mss[v] = max(mss[(v << 1 | 1)], mss[(v << 1)] + sum[(v << 1 | 1)]);   }   void build(int v, int tl, int tr) {     if (tl == tr)       sum[v] = mss[v] = -1;     else {       build((v << 1), tl, ((tl + tr) >> 1));       build((v << 1 | 1), ((tl + tr) >> 1) + 1, tr);       push_up(v);     }   }   void add(int v, int tl, int tr, int p, int x) {     if (tl == tr)       sum[v] = mss[v] += x;     else {       push_down(v, tl, tr);       if (p <= ((tl + tr) >> 1))         add((v << 1), tl, ((tl + tr) >> 1), p, x);       else         add((v << 1 | 1), ((tl + tr) >> 1) + 1, tr, p, x);       push_up(v);     }   }   int tmp;   int query(int v, int tl, int tr, int l, int r) {     static int res;     if (v == 1) res = -1;     if (tl >= l and tr <= r) {       res = max(res, mss[v] + tmp);       tmp += sum[v];     } else {       push_down(v, tl, tr);       if (r > ((tl + tr) >> 1))         query((v << 1 | 1), ((tl + tr) >> 1) + 1, tr, l, r);       if (l <= ((tl + tr) >> 1)) query((v << 1), tl, ((tl + tr) >> 1), l, r);     }     return res;   }   void set(int v, int tl, int tr, int l, int r) {     if (tl >= l and tr <= r) {       sum[v] = -(tr - tl + 1);       mss[v] = -1;       marked[v] = true;     } else {       push_down(v, tl, tr);       if (l <= ((tl + tr) >> 1)) set((v << 1), tl, ((tl + tr) >> 1), l, r);       if (r > ((tl + tr) >> 1)) set((v << 1 | 1), ((tl + tr) >> 1) + 1, tr, l, r);       push_up(v);     }   }   }  // namespace segtree   int main() {     ios::sync_with_stdio(false);     cin.tie(0);     cout.tie(0);     int n, q;     cin >> n >> q;     for (int i = 2; i <= n; i += 1) cin >> p[i];     for (int i = n; i >= 2; i -= 1) sz[p[i]] += sz[i] += 1;     for (int i = 2; i <= n; i += 1)       if (sz[i] > sz[hs[p[i]]]) hs[p[i]] = i;     for (int i = 1; i <= n; i += 1)       if (i == hs[p[i]]) {         top[i] = top[p[i]];         dfn[i] = dfn[p[i]] + 1;       } else {         top[i] = i;         dfn[i] = dfn[p[i]] + ssz[p[i]] + sz[hs[p[i]]] + 1;         ssz[p[i]] += sz[i];       }     segtree::build(1, 1, n);     for (int t, v; q; q -= 1) {       cin >> t >> v;       if (t == 1)         segtree::add(1, 1, n, dfn[v], 1);       else if (t == 3) {         int res = -1;         segtree::tmp = 0;         for (int x = v; x; x = p[top[x]])           res = max(res, segtree::query(1, 1, n, dfn[top[x]], dfn[x]));         cout << (res >= 0 ?  black n  :  white n );       } else {         segtree::set(1, 1, n, dfn[v], dfn[v] + sz[v] - 1);         int res = -1;         segtree::tmp = 0;         for (int x = v; x; x = p[top[x]])           res = max(res, segtree::query(1, 1, n, dfn[top[x]], dfn[x]));         if (res >= 0) segtree::add(1, 1, n, dfn[v], -res - 1);       }     }     return 0;   }   