[主席树] BZOJ 4571 [Scoi2016]美味

要是没有加 就是裸的可持久化字典树 其实字典树也就是线段树 按位贪心 然后在主席树上查一下某段是否有数字

#include<cstdio>
#include<cstdlib>
#include<algorithm>
using namespace std;

inline char nc(){
  static char buf[100000],*p1=buf,*p2=buf;
  return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
}
inline void read(int &x){
  char c=nc(),b=1;
  for (;!(c>='0' && c<='9');c=nc()) if (c=='-') b=-1;
  for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;
}

const int M=4000005;
const int N=200005;
const int _R=262144;
const int K=17;

int ncnt;
int ls[M],rs[M],sum[M];
int rt[N];

inline void Add(int &x,int y,int l,int r,int t){
  x=++ncnt;
  if (l==r){ sum[x]=sum[y]+1; return ; }
  int mid=(l+r)>>1;
  if (t<=mid)
    rs[x]=rs[y],Add(ls[x],ls[y],l,mid,t);
  else
    ls[x]=ls[y],Add(rs[x],rs[y],mid+1,r,t);
  sum[x]=sum[ls[x]]+sum[rs[x]];
}
inline int Sum(int x,int y,int l,int r,int ql,int qr){
  if (ql<=l && r<=qr)
    return sum[y]-sum[x];
  int mid=(l+r)>>1,ret=0;;
  if (ql<=mid) ret+=Sum(ls[x],ls[y],l,mid,ql,qr);
  if (qr>mid) ret+=Sum(rs[x],rs[y],mid+1,r,ql,qr);
  return ret;
}

int n;

int main(){
  int Q,x,a,b,ql,qr,l,r;
  freopen("t.in","r",stdin);
  freopen("t.out","w",stdout);
  read(n); read(Q);
  for (int i=1;i<=n;i++) read(x),Add(rt[i],rt[i-1],0,_R-1,x);
  while (Q--){
    read(b); read(a); read(l); read(r);
    int ans=0,pre=0;
    for (int k=K;~k;k--)
      if (b>>k&1){
    ql=pre+0,qr=pre+(1<<k)-1;
    if (qr<a) { pre+=1<<k; continue; }
    ql=max(0,ql-a); qr=max(0,qr-a);
    if (Sum(rt[l-1],rt[r],0,_R-1,ql,qr))
      ans+=1<<k,pre+=0<<k;
    else
      pre+=1<<k;
      }else{
    ql=pre+(1<<k); qr=pre+(1<<(k+1))-1;
    if (qr<a) { pre+=0<<k; continue; }
    ql=max(0,ql-a); qr=max(0,qr-a);
    if (Sum(rt[l-1],rt[r],0,_R-1,ql,qr))
      ans+=1<<k,pre+=1<<k;
    else
      pre+=0<<k;
      }
    printf("%d\n",ans);
  }
  return 0;
}