HDU - 6191 Query on A Tree (启发式合并\可持续化)

HDU - 6191 Query on A Tree

题目链接： https://cn.vjudge.net/problem/HDU-6191

题意

有一颗结点为N个的树，每个结点都有一个权值，有Q个询问，每次询问一个u,x，查询以u以下的子树中能与x异或组成最大的数是多少。

数据范围： $1\le N,Q\le 10^5;1\le x\le 10^9$

---

思路

离线一下，从叶子结点向上合并，只有当前结点所有的子树都被访问完了后，才对其进行询问操作。

也可以在线操作，将其DFS序生成出来，利用可持续化的思想，对区间查询能组成最大的数进行query

---

代码

#include <iomanip>
#include <cstring>
#include <cstdlib>
#include <cctype>
#include <cstdio>
#include <string>
#include <stack>
#include <cmath>
#include <ctime>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <vector>
#include <sstream>
#include <memory>
#include <iostream>
#include <algorithm>
using namespace std;
#define rep(i,j,k) for(int i = (int)j;i <= (int)k;i ++)
#define debug(x) cerr<<#x<<":"<<x<<endl
#define pb push_back
void test(){cerr<<"\n";}
template<typename T,typename... Args>void test(T x,Args... args){cerr<<x<<" ";test(args...);}

typedef long long ll;
typedef pair<int,int> pi;
const int MAXN = (int)1e5+7;
const int MaxTot = 35*100000+7; //注意大小为 N*len
const int INF = (int)0x3f3f3f3f;

inline int rd() { int c = 0, f = 1;char ch = getchar();
    while (ch < '0' || ch > '9') {if (ch == '-') f = -1;ch = getchar();}
    while (ch >= '0' && ch <= '9') {c = c * 10 + ch - '0';ch = getchar();}
    return c * f;
}
int N,Q;
int root[MAXN],val[MAXN],tot;
struct state{
    int next[2];
}tree[MaxTot];

inline void insert(int rt,char *S) {
    int n = strlen(S);
    int now = rt;
    rep(i,0,n-1) {
        int c = S[i]-'0';
        if (tree[now].next[c] == 0) {
            tree[now].next[c] = ++tot;
        }
        now = tree[now].next[c];
    }
}

inline int Merge(int u,int v) {
    if (u==0||v==0) return u|v;
    tree[u].next[0] = Merge(tree[u].next[0],tree[v].next[0]);
    tree[u].next[1] = Merge(tree[u].next[1],tree[v].next[1]);
    return u;
}

inline int findMx(int rt,char *S) {
    int n = strlen(S);
    int now = rt;
    int res = 0;
    rep(i,0,n-1) {
        int c = S[i]-'0';
        int qi = c^1;
        if (tree[now].next[qi] == 0) {
            res = res*2;
            now = tree[now].next[c];
        }else {
            res = res*2+1;
            now = tree[now].next[qi];
        }
    }
    return res;
}

char str[50];
inline void toString(int x) {
    int len = 0;
    if (x == 0) str[len++] = '0';
    while (x) {
        str[len++] = x%2+'0';
        x >>= 1;
    }
    rep(i,len,29) str[i] = '0';
    reverse(str,str+30);
    str[30] = 0;
}

int deg[MAXN];
vector<int> G[MAXN];
queue<int> qu;
vector<pi> ask[MAXN];
int ans[MAXN];

int main()
{
    while (scanf("%d %d",&N,&Q)==2) {
        memset(tree,0,sizeof(state)*(N*32));
        rep(i,1,N) G[i].clear(),ask[i].clear();tot = 0;
        while (!qu.empty()) qu.pop();

        rep(i,1,N) val[i] = rd();
        rep(i,2,N) {
            int fa = rd();
            deg[fa] ++;
            G[i].pb(fa);
        }
        rep(i,1,N) {
            root[i] = ++tot;
            if (deg[i] == 0) qu.push(i);
        }
        rep(i,1,Q) {
            int u = rd(),x = rd();
            ask[u].pb(make_pair(x,i));
        }
        while (!qu.empty()) {
            int k = qu.front();qu.pop();
            toString(val[k]);
            insert(root[k],str);
            if (ask[k].size()) {
                rep(i,0,ask[k].size()-1) {
                    int id = ask[k][i].second;
                    int x = ask[k][i].first;
                    toString(x);
                    int res = findMx(root[k],str);
                    ans[id] = res;
                }
            }
            rep(i,0,G[k].size()-1) {
                int fa = G[k][i];
                root[fa] = Merge(root[k],root[fa]);
                if (--deg[fa] == 0) {
                    qu.push(fa);
                }
            }
        }
        rep(i,1,Q) {
            printf("%d\n",ans[i]);
        }
    }
}