关于数据范围，求巨佬解答，必关！！！

#include <bits/stdc++.h>
using namespace std;
int n, res[111111];
vector<int> g[111111];
int ch[100003*32][2], idx;
int cnt[100003*32];
void insert(int x){
    int q = 0;
    for (int i = 30; i >= 0; i --){
        int j = (x >> i) & 1;
        if (!ch[q][j]) ch[q][j] = ++idx;
        q = ch[q][j];
        cnt[q] ++;
    }
}
int query(int x){
    int p = 0;
    int ans = 0;
    for (int i = 30; i >= 0; i --){
        int j = (x >> i) & 1;
        if (ch[p][!j]){
            ans += (1 << i);
            p = ch[p][!j];
        }
        else p = ch[p][j];
    }
    return ans;
}
void erase(int x){
    int p = 0;
    for (int i = 30; i >= 0; i --){
        int j = (x >> i) & 1;
        int p2 = p;
        p = ch[p][j];
        cnt[p] --;
        if (cnt[p] == 0) ch[p2][j] = 0;
    }
}
int main(){
    cin >> n;
    for (int i = 1; i <= n; i ++){
        cin >> res[i];
        insert(res[i]);
    }
    for (int i = 1; i <= n; i ++){
        int fa; cin >> fa;
        if (fa == -1) continue;
        g[fa+1].push_back(i);
        g[i].push_back(fa+1);
    }
    int ans = 0;
    for (int i = 1; i <= n; i ++){
        for (auto j : g[i]){
            erase(res[j]);
        }
        ans = max(ans, query(res[i]));
        for (auto j : g[i]){
            insert(res[j]);
        }
    }
    cout << ans;
    return 0;
}

#include <bits/stdc++.h>
using namespace std;
int n, res[111111];
vector<int> g[111111];
int ch[1000031*32][2], idx;
int cnt[1000031*32];
void insert(int x){
    int q = 0;
    for (int i = 30; i >= 0; i --){
        int j = (x >> i) & 1;
        if (!ch[q][j]) ch[q][j] = ++idx;
        q = ch[q][j];
        cnt[q] ++;
    }
}
int query(int x){
    int p = 0;
    int ans = 0;
    for (int i = 30; i >= 0; i --){
        int j = (x >> i) & 1;
        if (ch[p][!j]){
            ans += (1 << i);
            p = ch[p][!j];
        }
        else p = ch[p][j];
    }
    return ans;
}
void erase(int x){
    int p = 0;
    for (int i = 30; i >= 0; i --){
        int j = (x >> i) & 1;
        int p2 = p;
        p = ch[p][j];
        cnt[p] --;
        if (cnt[p] == 0) ch[p2][j] = 0;
    }
}
int main(){
    cin >> n;
    for (int i = 1; i <= n; i ++){
        cin >> res[i];
        insert(res[i]);
    }
    for (int i = 1; i <= n; i ++){
        int fa; cin >> fa;
        if (fa == -1) continue;
        g[fa+1].push_back(i);
        g[i].push_back(fa+1);
    }
    int ans = 0;
    for (int i = 1; i <= n; i ++){
        for (auto j : g[i]){
            erase(res[j]);
        }
        ans = max(ans, query(res[i]));
        for (auto j : g[i]){
            insert(res[j]);
        }
    }
    cout << ans;
    return 0;
}