坑:会容易re。。。。第二维开大点多不行。。
https://cn.vjudge.net/problem/LightOJ-1269
#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <map>
//#include<bits/stdc++.h>
using namespace std;
#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%lld",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
/*
//---------------------------------------------------------
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/hash_policy.hpp>
#include <ext/pb_ds/priority_queue.hpp>
using namespace __gnu_pbds;
*/
//gp_hash_table<string,int>mp2;
//__gnu_pbds::priority_queue<int>q;//因为放置和std重复,故需要带上命名空间
//__gnu_pbds::priority_queue<int,greater<int>,pairing_heap_tag> pq;//最快
//----------------------------------------------------------
/*
//----------------------------------------------------------
const int BufferSize = 1 << 16;
char buffer[BufferSize], *_head, *_tail;
inline char Getchar() {
if (_head == _tail) {
int l = fread(buffer, 1, BufferSize, stdin);
_tail = (_head = buffer) + l;
}
return *_head++;
}
inline int read() {
int x = 0, f = 1;char c = Getchar();
for (;!isdigit(c);c = Getchar()) if (c == '-') f = -1;
for (;isdigit(c);c = Getchar()) x = x * 10 + c - '0';
return x * f;
}
//----------------------------------------------------------
*/
const int maxn=3e6+9;
const int mod=1e9+7;
int tree[maxn][2];
int sum[maxn];
int flagg[maxn];
int tot;
int Min,Max,ans_min,ans_max;
void insert_str(int num)
{
int rt=0;
int pos=30;
int id;
while(pos!=-1)
{
if(num&(1<<pos)) id=1;
else id=0;
if(!tree[rt][id]) tree[rt][id]=++tot;
rt=tree[rt][id];
pos--;
}
}
void find_str(int num)
{
int rt1=0;
int rt2=0;
int id;
int pos=30;
Min=0;
Max=0;
while(pos!=-1)
{
if(num&(1<<pos)) id=1;
else id=0;
if(tree[rt1][id^1])
{
rt1=tree[rt1][id^1];
Max^=(1<<pos);
}
else
{
rt1=tree[rt1][id];
}
if(tree[rt2][id])
{
rt2=tree[rt2][id];
}
else
{
rt2=tree[rt2][id^1];
Min^=(1<<pos);
}
pos--;
}
}
void init()
{
for(int i=0;i<=tot;i++)
{
for(int j=0;j<2;j++) tree[i][j]=0;
}
tot=0;
}
int main()
{
//FAST_IO;
//freopen("input.txt","r",stdin);
int t;
sfi(t);
int cas=1;
while(t--)
{
init();
int n;
sfi(n);
ans_min=INF;
ans_max=0;
for(int i=0;i<=n;i++) sum[i]=0;
insert_str(0);
for(int i=1;i<=n;i++)
{
ll x;
sfl(x);
sum[i]=sum[i-1]^x;
find_str(sum[i]);
ans_min=min(ans_min,Min);
ans_max=max(ans_max,Max);
insert_str(sum[i]);
}
printf("Case %d: %lld %lld\n",cas++,ans_max,ans_min);
}
return 0;
}