美味-主席树
题目描述
题解
代码
#include<bits/stdc++.h>
#define M 600009
using namespace std;
int read(){
int f=1,re=0;
char ch;
for(ch=getchar();!isdigit(ch)&&ch!='-';ch=getchar());
if(ch=='-'){f=-1,ch=getchar();}
for(;isdigit(ch);ch=getchar()) re=(re<<3)+(re<<1)+ch-'0';
return re*f;
}
struct tree{
int l,r,num;
}tr[M*16];
int rt[M],a[M],cnt,n,m,maxn;
void build(int x,int &y,int l,int r,int val){
y=++cnt;
tr[y]=tr[x];
tr[y].num++;
if(l==r) return;
int mid=(l+r)>>1;
if(val<=mid) build(tr[x].l,tr[y].l,l,mid,val);
else build(tr[x].r,tr[y].r,mid+1,r,val);
}
int query(int x,int y,int l,int r,int ql,int qr){
if(r<ql||l>qr||tr[x].num-tr[y].num==0) return 0;
if(l>=ql&&r<=qr) return tr[y].num-tr[x].num;
int mid=(l+r)>>1,ret=0;
if(ql<=mid) ret+=query(tr[x].l,tr[y].l,l,mid,ql,qr);
if(qr>mid) ret+=query(tr[x].r,tr[y].r,mid+1,r,ql,qr);
return ret;
}
int main(){
n=read(),m=read();
for(int i=1;i<=n;i++){
a[i]=read();
maxn=max(maxn,a[i]);
}for(int i=1;i<=n;i++) build(rt[i-1],rt[i],0,maxn,a[i]);
for(int i=1;i<=m;i++){
int ans=0;
int b=read(),x=read(),l=read(),r=read();
for(int i=18;i>=0;i--){
if(b&(1<<i)&&!query(rt[l-1],rt[r],0,maxn,ans-x,ans-x+(1<<i)-1)) ans+=(1<<i);
if(!(b&(1<<i))&&query(rt[l-1],rt[r],0,maxn,ans-x+(1<<i),ans-x+(1<<(i+1))-1)) ans+=(1<<i);
}printf("%d\n",ans^b);
}return 0;
}