传送门:
http://codeforces.com/problemset/problem/617/E
题意:
多次询问在给定区间内有多少个区间的异或和为k
终于有一道和区域赛靠边的题了
首先对a数组亦或取前缀s[i]
注意到s[j]^s[i-1]=a[i]^a[i+1]^…^a[j]=k
则统计的时候可以 s[j]^k=s[i-1] (a^a=0)
只要记录当前插入的数的个数就可以了
注意在first下标减完1后统计的数的下标不可以相同,但亦或的结果可能相同
code:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
using namespace std;
#define MAXN 100010
int n,m,k,black;
struct node{
int l,r,id;
}b[MAXN];
long long ans[MAXN];
int pos[MAXN],num[1<<20],a[MAXN];
int cmp(node a,node b)
{
if (pos[a.l]==pos[b.l]) return a.r<b.r;
return pos[a.l]<pos[b.l];
}
int l,r;
long long tmp;
void solve()
{
memset(num,0,sizeof(num));
tmp=0;
l=1;r=0;
for (int i=1;i<=m;i++)
{
while (r<b[i].r) {r++;tmp+=(long long)num[a[r]^k];num[a[r]]++;}
while (r>b[i].r) {num[a[r]]--;tmp-=(long long)num[a[r]^k];r--;}
while (l<b[i].l) {num[a[l]]--;tmp-=(long long)num[a[l]^k];l++;}
while (l>b[i].l) {l--;tmp+=(long long)num[a[l]^k];num[a[l]]++;}
ans[b[i].id]=tmp;
}
}
int main()
{
scanf("%d%d%d", &n, &m, &k);
black=(int)sqrt(n);
for (int i=1;i<=n;i++)
{
scanf("%d", &a[i]);
a[i]^=a[i-1];
pos[i]=(i-1)/black+1;
}
for (int i=1;i<=m;i++)
{
scanf("%d%d", &b[i].l, &b[i].r);
b[i].l--;
b[i].id=i;
}
sort(b+1,b+m+1,cmp);
solve();
for (int i=1;i<=m;i++)
{
printf("%I64d\n",ans[i]);
}
}