Consider an array AA with n elements . Each of its element is A[i]A[i] (1 \le i \le n)(1≤i≤n) . Then gives two integers QQ, KK, and QQ queries follow . Each query , give you LL, RR, you can get ZZ by the following rules.
To get ZZ , at first you need to choose some elements from A[L]A[L] to A[R]A[R] ,we call them A[i_1],A[i_2]…A[i_t]A[i1],A[i2]…A[it] , Then you can get number Z = KZ=K or (A[i_1]A[i1] xor A[i_2]A[i2] … xor A[i_t]A[it]) .
Please calculate the maximum ZZ for each query .
Input
Several test cases .
First line an integer TT (1 \le T \le 10)(1≤T≤10) . Indicates the number of test cases.Then TT test cases follows . Each test case begins with three integer NN, QQ, KK (1 \le N \le 10000,\ 1 \le Q \le 100000 , \ 0 \le K \le 100000)(1≤N≤10000, 1≤Q≤100000, 0≤K≤100000) . The next line has NN integers indicate A[1]A[1] to A[N]A[N] (0 \le A[i] \le 10^8)(0≤A[i]≤108). Then QQ lines , each line two integer LL, RR (1 \le L \le R \le N)(1≤L≤R≤N) .
Output
For each query , print the answer in a single line.
样例输入复制
1 5 3 0 1 2 3 4 5 1 3 2 4 3 5
样例输出复制
3 7 7
题目来源
题目大意:n个数,一个k,每次查询l,r内的任意个数异或后再或上k的最大值。
解题思路:由于k是固定的,并且是区间的异或值或上k,所以k的值为1的位我们不用管,我们需要将k的二进制位位0的那些位上出现尽可能多的1。
转换一下思路就是我们得到k的那些二进制为0,然后将a[i],与上这个值,因为只有这些位置是有贡献的。
我们需要尽可能多的1,然后就转化为区间异或起来最大了。
对于一个区间的查询,我们就利用线段树合并区间间的线性基,合并过程就是将一个线性基插入到另一个
线性基里边,最简单的实现就是重载加号。。。
#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define pb(x) push_back(x)
#define lowb(x) (x&(-x))
#define sca(x) scanf("%d",&x)
#define fir first
#define sec second
#define mp(x,y) make_pair(x,y)
const int N = 10000+5;
const int mod =1e9+7;
int a[N];
struct node
{
int c[33];
node(){memset(c,0,sizeof(c));}
}t[N*4];
void _ins(int id,int val)
{
for(int i=31;i>=0;i--)
{
int now=(val>>i)&1;
if(now)
{
if(t[id].c[i]==0)
{
t[id].c[i]=val;
break;
}
val^=t[id].c[i];
}
}
}
node operator + (node x,node y)
{
node z;
for(int i=31;i>=0;i--) z.c[i]=x.c[i];
for(int i=31;i>=0;i--)
{
int val=y.c[i];
if(val==0)continue;
for(int j=31;j>=0;j--)
{
int now=(val>>j)&1;
if(now)
{
if(z.c[j]==0)
{
z.c[j]=val;
break;
}
val^=z.c[j];
}
}
}
return z;
}
void build(int rt,int l,int r)
{
if(l==r)
{
_ins(rt,a[l]);
return ;
}
int m=(l+r)>>1;
build(rt<<1,l,m);
build(rt<<1|1,m+1,r);
t[rt]=t[rt<<1]+t[rt<<1|1];
}
int ask(node tmp)
{
int ans=0;
for(int i=31;i>=0;i--)
{
if(tmp.c[i]) ans=max(ans,ans^tmp.c[i]);
}
return ans;
}
node query(int rt,int l,int r,int ql,int qr)
{
if(l>=ql && r<=qr)
{
return t[rt];
}
int m=(l+r)>>1;
node z1,z2;
if(ql<=m) z1=query(rt<<1,l,m,ql,qr);
if(qr>m) z2=query(rt<<1|1,m+1,r,ql,qr);
return z1+z2;
}
int main()
{
int _t;
cin>>_t;
while(_t--)
{
int n,m,k;
sca(n),sca(m),sca(k);
int val=0;
for(int i=31;i>=0;i--)
{
int now=(k>>i)&1;
if(now==0)val|=(1<<i);
}
for(int i=1;i<=n;i++)
{
sca(a[i]);
a[i]=a[i]&val;
}
build(1,1,n);
for(int i=1;i<=m;i++)
{
int l,r;
sca(l),sca(r);
node tmp=query(1,1,n,l,r);
int ans=ask(tmp);
ans|=k;
printf("%d\n",ans);
}
}
}