Query on A Tree HDU - 6191

分析：

解法1：离线+trie合并（自下而上合并）
解法2：可持久化数据结构

代码：

//解法1
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;//三年竞赛一场空，不开long long见祖宗 
//typedef __int128 lll;
#define print(i) cout << "debug: " << i << endl
#define close() ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define mem(a, b) memset(a, b, sizeof(a))
#define mp(a, b) make_pair(a, b)
#define x first
#define y second
typedef pair<int, int> par;
const ll mod = 1e9 + 7;
const int maxn = 1e5 + 10;
const int inf = 0x3f3f3f3f;
vector<par> buf[maxn];
vector<int> g[maxn];
int v[maxn], ans[maxn];
int t[maxn * 35][2];
int root[maxn << 5];
int tot;
int n, q;

void insert(int r, int val)
{
    int now = r;
    for(int i = 30; i >= 0; i--)
    {
        int bit = val >> i & 1;
        if(!t[now][bit]) t[now][bit] = ++tot;
        now = t[now][bit];
    }
}

int Union(int r1, int &r2)
{
    if(!r1) return r2;
    if(!r2) return r1;
    t[r1][0] = Union(t[r1][0], t[r2][0]);
    t[r1][1] = Union(t[r1][1], t[r2][1]);
    r2 = 0;
    return r1;
}

int query(int r, int val)
{
    int now = r, res = 0;
    for(int i = 30; i >= 0; i--)
    {
        int bit = val >> i & 1;
        if(t[now][bit ^ 1]) res |= (1 << i), now = t[now][bit ^ 1];
        else now = t[now][bit];
    }
    return res;
}

void dfs(int u)
{
    insert(root[u], v[u]);
    for(int i = 0; i < g[u].size(); i++)
    {
        int ep = g[u][i];
        dfs(ep);
        root[u] = Union(root[u], root[ep]);
    }
    for(auto i : buf[u])
        ans[i.x] = query(root[u], i.y);
}


int main()
{
    while(cin >> n >> q)
    {
        mem(root, 0);
        mem(t, 0);
        for(int i = 1; i <= n; i++)
            buf[i].clear(), g[i].clear();
        tot = n;
        for(int i = 1; i <= n; i++) scanf("%d", v + i), root[i] = i;
        for(int i = 2; i <= n; i++)
        {
            int f; scanf("%d", &f);
            g[f].push_back(i);
        }
        for(int i = 1; i <= q; i++)
        {
            ll u, tar; scanf("%d%d", &u, &tar);
            buf[u].push_back(mp(i, tar));
        }
        dfs(1);
        for(int i = 1; i <= q; i++)
            printf("%d\n", ans[i]);
    }

}

//解法2