[杂题] SnackDown 2017 Online Elimination Round #PREFIXOR Prefix XOR

考虑$s_r\ \text{xor} \ s_{i-1}\le s_{r+1}\ \text{xor} \ s_{i-1}$
相当于对$s_{i-1}$第k位有一个限制 k是$s_{r}$和$s_{r+1}$的LCP后一位

然后就能很快算出每个点向右的答案 主席树一发

#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cassert>
using namespace std;
typedef long long ll;

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;
}

inline ll ssum(ll n){
  return n*(n+1)/2;
}
inline ll ssum(ll l,ll r){
  return ssum(r)-ssum(l-1);
}

const int N=400005;
const int M=10000005;

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

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

const int K=30;

int n,a[N],s[N];
int must[K][2];
int ans[N];

int main(){
  freopen("t.in","r",stdin);
  freopen("t.out","w",stdout);
  read(n); for (int i=1;i<=n;i++) read(a[i]),s[i]=s[i-1]^a[i];
  for (int k=0;k<K;k++) must[k][0]=must[k][1]=n+1;
  for (int i=n;i;i--){
    int rr=n+1;
    for (int k=K-1;~k;k--)
      rr=min(rr,must[k][(s[i-1]>>k&1)^1]);
    ans[i]=(--rr);
    for (int k=K-1;~k;k--)
      if ((s[i-1]>>k&1)^(s[i]>>k&1)){
    must[k][(s[i]>>k&1)^1]=i; break;
      }
  }
  /*for (int i=1;i<=n;i++){
    ll x=a[i];
    int ff=0;
    for (int j=i+1;j<=n;j++){
      if ((x^a[j])<x)
    { ff=j-1; break; }
      x^=a[j];
    }
    if (ff==0) ff=n;
    assert(ff==ans[i]);
    }*/
  for (int i=1;i<=n;i++)
    Add(rt[i],rt[i-1],1,n,ans[i]);
  int Q,l,r;
  read(Q); ll lastans=0;
  while (Q--){
    read(l); read(r);
    l=((ll)l+lastans)%n+1;
    r=((ll)r+lastans)%n+1;
    ll sum=Sum(rt[r],rt[l-1],1,n,l,r),cnt=Cnt(rt[r],rt[l-1],1,n,r+1,n);
    printf("%lld\n",lastans=sum+cnt*r-ssum(l,r)+(r-l+1));
  }
  return 0;
}