分析
我焯,我真的是麻了…优先级的问题找了一下午bug…
(query_max(x) ^ x) == r 记得要打括号!!!
注意字典树的初始化(因为我们是++idx,所以后初始化)
tr[p][u] = ++idx;
tr[idx][0] = tr[idx][1] = 0;
void init()
{
idx = 0;
tr[0][0] = tr[0][1] = 0;
}
总结:
- 学到了字典树的初始化
- 01字典树的经典用法:找一个集合中和 x 异或值最大/最小的数
代码
#include<iostream>
#include<queue>
#include<cstring>
#include<vector>
#include<stdio.h>
#include<map>
#include<algorithm>
#include<deque>
#include<stack>
#include<set>
// #include <unordered_map>
#include<math.h>
#include<string.h>
#define IOS ios::sync_with_stdio(false),cin.tie(0);
using namespace std;
#define pb push_back
#define coutl cout<<"------------"<<endl;
#define fi first
#define se second
#define ire(x) scanf("%d",&x)
#define iire(a,b) scanf("%d %d",&a,&b)
#define lre(x) scanf("%lld",&x)
#define llre(a,b) scanf("%lld %lld",&a,&b)
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define endl "\n"
#define PI acos(-1.0)
//#define int long long
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef pair<double, int> PDI;
typedef pair<ll, ll> PLL;
typedef pair<double, double> PDD;
typedef pair<double, pair<int, double> > PDID;
typedef pair<char, char> PCC;
typedef pair<char, pair<int, int> > PCII;
typedef pair<int, pair<int, int> > PIII;
typedef pair<int, pair<int, pair<int, int> > > PIIII;
typedef pair<ll, pair<int, int> > PLII;
const int maxn = 2e5 + 7;
const int N = 2e6 + 7;
const int M = 4e6 + 7;
const int mod = 3*5*7*11*13*17*19*23;
const int inv = mod - mod/2;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const double pi = acos(-1);
const double eps = 1e-8;
ll gcd(ll a,ll b) {return b==0 ? a : gcd(b,a%b);}
ll lcm(ll a,ll b) {return a*b / gcd(a,b);}
ll qmi(ll a,ll b,ll p) {ll ans = 1; while(b) { if(b & 1) ans = ans * a % p; a = a * a % p; b >>= 1; } return ans;}
int lowbit(int x) {return x & (-x);}
int a[maxn];
int tr[maxn * 31][2],idx; //01字典树
int n;
void insert(int x) //插入
{
int p = 0;
for(int i=30;i>=0;i--)
{
int u = x >> i & 1;
if(!tr[p][u])
{
tr[p][u] = ++idx;
tr[idx][0] = tr[idx][1] = 0; //初始化!!!
}
p = tr[p][u];
}
}
int query_max(int x) //01字典树中查询和x异或值最大的数
{
int ans = 0;
int p = 0;
for(int i=30;i>=0;i--)
{
int u = x >> i & 1;
if(tr[p][!u])
{
p = tr[p][!u];
ans = (ans << 1) + (!u);
}
else
{
p = tr[p][u];
ans = (ans << 1) + u;
}
}
return ans;
}
int query_min(int x) //01字典树中查询和x异或值最小的数
{
int ans = 0;
int p = 0;
for(int i=30;i>=0;i--)
{
int u = x >> i & 1;
if(tr[p][u])
{
p = tr[p][u];
ans = (ans << 1) + u;
}
else
{
p = tr[p][!u];
ans = (ans << 1) + (!u);
}
}
return ans;
}
void init() //初始化
{
idx = 0;
tr[0][0] = tr[0][1] = 0;
}
void solve()
{
init();
int l,r;
iire(l,r);
for(int i=l;i<=r;i++)
{
ire(a[i]);
insert(a[i]);
}
for(int i=l;i<=r;i++)
{
int x = a[i] ^ l;
if((query_max(x)^x) == r && (query_min(x)^x) == l)
{
cout<<x<<'\n';
break;
}
}
}
int main()
{
int t;
ire(t);
while(t--)
{
solve();
}
return 0;
}