CF 617E(XOR and Favorite Number-莫队算法)

已知一个长度为n的数列 (0 ≤ ai ≤ 1 000 000) ，给m个区间，问每个区间有多少个子区间xor和为k
(1 ≤ n, m ≤ 100 000, 0 ≤ k ≤ 1 000 000)

转前缀和，莫队

#include <iostream>
#include <cmath>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <string>
#include <vector>
#include <map>
#include <functional>
#include <cstdlib>
#include <queue>
#include <stack>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=Pre[x];p;p=Next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=Next[p])  
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,127,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define INF (2139062143)
#define F (100000007)
#define pb push_back
#define mp make_pair 
#define fi first
#define se second
#define vi vector<int> 
#define pi pair<int,int>
#define SI(a) ((a).size())
typedef long long ll;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return (a-b+llabs(a-b)/F*F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
int read()
{
    int x=0,f=1; char ch=getchar();
    while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
    while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
    return x*f;
}

#define MAXN (4000000+10) 
int SQ=320;
pair< pair<int,int> ,int> q[MAXN];
int cmp ( pair< pair<int,int> ,int > a, pair< pair<int,int>, int > b){
    if (a.fi.fi/SQ==b.fi.fi/SQ) return a.fi.se<b.fi.se;
    return a.fi.fi<b.fi.fi;
}
int n,m,k;
int a[MAXN]={0};
ll ans[MAXN]={0};
int cnt[MAXN]={0};
int main() {
    n=read(), m=read(), k=read();
    For(i,n) a[i]=read();
    //SQ=sqrt(n);
    Fork(i,2,n) a[i]^=a[i-1];
    For(i,m) {
        int l=read(),r=read(); l--;
        q[i]=mp(mp(l,r),i);
    }
    sort(q+1,q+1+m,cmp);
    int nowl=0,nowr=0;
    ll nowans=0; cnt[0]=1;
    For(i,m) {
        int l=q[i].fi.fi,r=q[i].fi.se;
        Fork(j,nowl,l-1) {cnt[a[j]]--; nowans-=cnt[a[j]^k]; }
        Fork(j,r+1,nowr) {cnt[a[j]]--; nowans-=cnt[a[j]^k]; }
        Fork(j,l,nowl-1) {nowans+=cnt[a[j]^k]; cnt[a[j]]++; }
        Fork(j,nowr+1,r) {nowans+=cnt[a[j]^k]; cnt[a[j]]++; }
        nowl=l,nowr=r;
        ans[q[i].se]=nowans;
    }
    For(i,m) printf("%I64d\n",ans[i]);
    return 0;
}