Codeforces 617E XOR and Favorite Number（莫队）

题意：n个数,有m个询问,问[l,r]之间有多少对i和j满足a[i]^a[i+1]^...^a[j]=k;  (l <= i <= j <= r)

分析：

         明显莫队。（优雅的暴力）

    前缀异或和数组sum[ ]，现在我们要求区间[L,R]的异或的值，用sum数组表示就是sum[L-1]^sum[R]=k,或者说是k^sum[R]=sum[L-1]。

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<string>
#include<vector>
#include<cctype>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<iomanip>
#include<sstream>
#include<limits>
#define ll long long
#define inf 0x3f3f3f3f
using namespace std;
const int maxn = 1e6+10;
const ll MOD = 1000000007;
const double EPS = 1e-10;
const double Pi = acos(-1.0);
struct Node{
  int l,r,id,x;
}Q[maxn];
ll ans[maxn];
ll a[maxn],num[maxn*2],sum[maxn];   //num数组开小了wa了几发
int unit;
bool cmp(Node a,Node b)
{
    if (a.x != b.x) return a.x < b.x;
    else return a.r<b.r;
}
int main(){
#ifdef LOCAL
	freopen("C:\\Users\\lanjiaming\\Desktop\\acm\\in.txt","r",stdin);
	//freopen("output.txt","w",stdout);
#endif
//ios_base::sync_with_stdio(0);
    int n,m,k;
    while(scanf("%d%d%d",&n,&m,&k) != EOF)
    {
        memset(sum,0,sizeof(sum));
        for(int i = 1; i <= n; i++)
        {
            scanf("%I64d",&a[i]);
            sum[i] = sum[i-1]^a[i];
        }
        unit = (int)sqrt(n);
        for(int i = 0; i < m; i++)
        {
            scanf("%d%d",&Q[i].l,&Q[i].r);
            Q[i].l--;     //预处理  好统计sum[L-1];
            Q[i].id = i;
            Q[i].x = (Q[i].l-1) / unit + 1;
            //Q[i].x = Q[i].l / unit;
        }

        sort(Q,Q+m,cmp);

        memset(num,0,sizeof(num));
        int L = Q[0].l, R = Q[0].l-1;
        ll temp = 0;
        for(int i = 0;i < m;i++)
        {
            while(R < Q[i].r)
            {
                R++;
                temp += num[k^sum[R]];
                num[sum[R]]++;
            }
            while(R > Q[i].r)
            {
                num[sum[R]]--;   //先减  避免l==r时出错
                temp -= num[k^sum[R]];
                R--;
            }
            while(L < Q[i].l)
            {
                num[sum[L]]--;
                temp -= num[k^sum[L]];
                L++;
            }
            while(L > Q[i].l)
            {
                L--;
                temp += num[k^sum[L]];
                num[sum[L]]++;
            }
            ans[Q[i].id] = temp;

        }
        for(int i = 0; i < m; i++) printf("%I64d\n",ans[i]);
    }
    return 0;
}