XOR and Favorite Number
time limit per test: 4 seconds
memory limit per test: 256 megabytes
input: standard input
output: standard output
Bob has a favorite number k and ai of length n. Now he asks you to answer m queries. Each query is given by a pair li and ri and asks you to count the number of pairs of integers i and j, such that l ≤ i ≤ j ≤ r and the xor of the numbers ai, ai + 1, …, aj is equal to k.
Input
The first line of the input contains integers n, m and k (1 ≤ n, m ≤ 100 000, 0 ≤ k ≤ 1 000 000) — the length of the array, the number of queries and Bob’s favorite number respectively.
The second line contains n integers ai (0 ≤ ai ≤ 1 000 000) — Bob’s array.
Then m lines follow. The i-th line contains integers li and ri (1 ≤ li ≤ ri ≤ n) — the parameters of the i-th query.
Output
Print m lines, answer the queries in the order they appear in the input.
Sample test(s)
Input
6 2 3
1 2 1 1 0 3
1 6
3 5
Output
7
0
Input
5 3 1
1 1 1 1 1
1 5
2 4
1 3
Output
9
4
4
Note
In the first sample the suitable pairs of i and j for the first query are: (1, 2), (1, 4), (1, 5), (2, 3), (3, 6), (5, 6), (6, 6). Not a single of these pairs is suitable for the second query.
In the second sample xor equals 1 for all subarrays of an odd length.
题意:
给出n个数,给出m个区间[L,R]的询问,问在[L,R]中有多少段子区间的异或和等于k。
思路:
莫队算法,求一个区间a[i]^a[i+1]^.......^a[j]=k的子段区间,第一步,要借助前前缀异或和,sum[i-1]^sum[j]=k(因为相同的数异或为0),
第二步,借助莫队算法的思想,推出只每一个区间的sum[R^k]有多少即可。
注意异或可能会超过给定的范围,还有注意long long
具体细节看实现代码:题解视频:https://www.bilibili.com/video/av4291097?from=search&seid=16994594754265240795
#include<cstdio>
#include<iostream>
#include<fstream>
#include<algorithm>
#include<functional>
#include<cstring>
#include<string>
#include<cstdlib>
#include<iomanip>
#include<numeric>
#include<cctype>
#include<cmath>
#include<ctime>
#include<queue>
#include<stack>
#include<list>
#include<set>
#include<map>
using namespace std;
const int maxn=1000005*2;
typedef long long ll;
int n,m,k;
//莫队算法主要处理离线问题,查询只给出L,R
//当[L,R]很容易向[L-1,R],[L+1,R],[L,R-1],[L,R+1]转移时可用莫队
//注意转移的时候先扩张再收缩,L先向右,L再向左,最后再收缩
//add就是当前区间添加某元素时要做的操作
//del就是当前区间删除某元素时要做的操作
//add,del函数写的时候都要注意结构顺序
struct node
{
int l,r,id;
}Q[maxn]; ///保存询问值
int pos[maxn];///保存所在块
bool cmp(const node &a,const node &b)///先按l所在块的大小排,在按r的位置排
{
if(pos[a.l]==pos[b.l])
return a.r<b.r;
return pos[a.l]<pos[b.l];
}
int num[maxn];///记录前缀异或和在当前区间出现的次数
int a[maxn];
ll ans[maxn];
int L=0,R=0;
ll Ans=0;
void add(int x)
{
Ans+=num[a[x]^k];
num[a[x]]++; ///先统计答案再加,以免多算一次当前的a[x],当前本身不能算
}
void del(int x)
{
num[a[x]]--;;///先减再统计答案,以免多减当前的a[x]
Ans-=num[a[x]^k];
}
int main()
{
while(scanf("%d%d%d",&n,&m,&k)!=-1)
{
int sz=sqrt(n);
for(int i=1;i<=n;i++)
{
scanf("%d",&a[i]);
a[i]=a[i]^a[i-1];
pos[i]=i/sz;
}
for(int i=1;i<=m;i++)
{
scanf("%d%d",&Q[i].l,&Q[i].r);
Q[i].id=i;
}
sort(Q+1,Q+1+m,cmp);
num[0]=1; ///没有数字的时后,表示前缀异或和为0
L=0;R=0;Ans=0;
for(int i=1;i<=m;i++)
{
while(R<Q[i].r)
{
R++;
add(R);
}
while(L+1>Q[i].l)
{
L--;
add(L);
}
while(L+1<Q[i].l)
{
del(L);
L++;
}
while(R>Q[i].r)
{
del(R);
R--;
}
ans[Q[i].id]=Ans;
}
for(int i=1;i<=m;i++)
printf("%lld\n",ans[i]);
}
return 0;
}