【异或】 01 字典树 / 权值线段树(0/1)_异或操作下的权值线段树-CSDN博客

本文链接：https://blog.csdn.net/heucodesong/article/details/89097355

这是一篇关于利用01字典树解决异或问题的博客，主要内容是通过将数值放入01字典树，并用全局异或标志来追踪异或结果，寻找最小未出现的非负整数（MEX）。文章提到，当某个节点的大小为2的幂次时，需要跳到下一个节点继续查找，同时提到了权值线段树也是解决此类问题的一种方法。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题意给你n个数然后每次都异或上一个数问你异或以后他的mex是啥 (mex就是没出现的最小非负整数)

做法我们首先把所有值放入一个 $01 字典树$ 内然后用一个全局 $x o r f l a g$ 标记代表是否需要异或
然后不断的找1这个点为了使得异或出的值最小然后这里有一个小trick 如果这个节点的sz值为
1<<i 说明这个节点都是满的那么你就需要跳到下一个节点从下一个节点开始找
听说好像也可以用权值线段树做留个坑吧

/*
    if you can't see the repay
    Why not just work step by step
    rubbish is relaxed
    to ljq
*/
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
using namespace std;

#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
#define lc (rt<<1)
#define rc (rt<<11)
#define mid ((l+r)>>1)

typedef pair<int,int> pll;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll _INF = 0xc0c0c0c0c0c0c0c0;
const ll mod =  (int)1e9+7;

ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){int ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}
void exgcd(ll a,ll b,ll &x,ll &y,ll &d){if(!b) {d = a;x = 1;y=0;}else{exgcd(b,a%b,y,x,d);y-=x*(a/b);}}//printf("%lld*a + %lld*b = %lld\n", x, y, d);
const int MAX_N = 300025;
int son[MAX_N*2][2],tot=1,sz[MAX_N*2],xorflag = 0,arr[MAX_N];
bool vis[MAX_N];
void Insert(int x)
{
    int p = 1;
    for(int i = 20;~i;--i)
    {
        int tmp = (x>>i)&1;
        if(!son[p][tmp]) son[p][tmp] = ++tot;
        p = son[p][tmp];
        ++sz[p];
    }
}
int get()
{
    int ans = 0,p = 1;
    for(int i = 20;~i;--i)
    {
        int tmp = (xorflag>>i)&1;
        if(sz[son[p][tmp]]==(1<<i))
        {
            p = son[p][!tmp];
            ans|=(1<<i);
        }
        else p = son[p][tmp];
    }
    return ans;
}
int main()
{
    //ios::sync_with_stdio(false);
    //freopen("a.txt","r",stdin);
    //freopen("b.txt","w",stdout);
    int n,d,Q;
    scanf("%d%d",&n,&Q);
    for(int i = 1;i<=n;++i)
    {
        scanf("%d",&arr[i]);
        if(!vis[arr[i]]) vis[arr[i]] = true,Insert(arr[i]);
    }
    while(Q--)
    {
        scanf("%d",&d);
        xorflag^=d;
        printf("%d\n",get());
    }
    //fclose(stdin);
    //fclose(stdout);
    //cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
    return 0;
}