莫队算法模板

题目链接：http://codeforces.com/contest/617/problem/E

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <stdio.h>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <queue>
#include <set>
#include <vector>
#include <map>
#define PR pair<int,int>
#define MP make_pair
#define fi first
#define se second
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define sqr(x) ((x)*(x))
#define ll long long
#define ull unsigned __int64
const ll INF = 1e18;
const int inf=0x3f3f3f3f;
const int M=25;
const int N=1<<20;
const int MOD=100000;
const double eps=1e-10;
const double pi=acos(-1.0);
using namespace std;

struct node
{
    int l,r,id;
}Q[N];

ll a[N],pos[N],flag[N],ans[N];
bool cmp(node x,node y)
{
    if(pos[x.l]==pos[y.l]) return x.r<y.r;
    return pos[x.l]<pos[y.l];
}

int n,m,k;
int L=1,R=0;
ll Ans;

void add(int x)
{
    Ans+=flag[a[x]^k];
    flag[a[x]]++;
}
void del(int x)
{
    flag[a[x]]--;
    Ans-=flag[a[x]^k];
}

int main()
{
    int i;
    scanf("%d%d%d",&n,&m,&k);
    int sz=sqrt(n);
    for(i=1;i<=n;i++)
    {
        scanf("%I64d",&a[i]);
        a[i]=a[i]^a[i-1];
        pos[i]=i/sz;
    }
    for(i=1;i<=m;i++)
    {
        scanf("%d%d",&Q[i].l,&Q[i].r);
        Q[i].id=i;
    }
    sort(Q,Q+m,cmp);
    flag[0]=1;
    for(i=1;i<=m;i++)
    {
        while(L<Q[i].l)
        {
            del(L-1);
            L++;
        }
        while(L>Q[i].l)
        {
            L--;
            add(L-1);
        }
        while(R<Q[i].r)
        {
            R++;
            add(R);
        }
        while(R>Q[i].r)
        {
            del(R);
            R--;
        }
        ans[Q[i].id]=Ans;
    }
    for(i=1;i<=m;i++)
    {
        printf("%I64d\n",ans[i]);
    }
}