题意
给出一个序列 a [ 1... n ] a[1...n] a[1...n] 和一个整数 K K K , q q q次询问区间 [ L , R ] [L,R] [L,R] 有几个子段的异或和等于 K K K
题解
只有询问且
1
≤
n
,
m
≤
1
0
5
1\le n,m \le 10^5
1≤n,m≤105所以考虑莫队算法,子段异或和可以用前缀和算出
加了奇偶优化会快不少
#include<iostream>
#include<sstream>
#include<string>
#include<queue>
#include<map>
#include<unordered_map>
#include<set>
#include<vector>
#include<stack>
#include <utility>
#include<list>
#include<bitset>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<iomanip>
#include<time.h>
#include<random>
using namespace std;
#include<ext/pb_ds/priority_queue.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/hash_policy.hpp>
using namespace __gnu_pbds;
#include<ext/rope>
using namespace __gnu_cxx;
#define int long long
#define PI acos(-1.0)
#define eps 1e-9
#define lowbit(a) ((a)&-(a))
const int mod = 1e9+7;
int qpow(int a,int b){
int ans=1;
while(b){
if(b&1)ans=(ans*a)%mod;
a=(a*a)%mod;
b>>=1;
}
return ans;
}
const int INF = 0x3f3f3f3f;
const int N = 2e6+10;
int a[N],ans[N],flag[N],B=313,block[N];
struct node{
int l,r,id;
bool friend operator<(const node x,const node y){
return block[x.l]==block[y.l]?block[x.l]&1?x.r<y.r:x.r>y.r:block[x.l]<block[y.l];
}
}q[N];
int n,m,k,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];}
#define endl '\n'
signed main(){
std::ios::sync_with_stdio(false);
cin.tie(0),cout.tie(0);
cin>>n>>m>>k;
for(int i=1;i<=n;i++)cin>>a[i],a[i]^=a[i-1],block[i]=i/B+1;
for(int i=1;i<=m;i++)cin>>q[i].l>>q[i].r,q[i].id=i;
sort(q+1,q+1+m);
flag[0]=1;
int l=0,r=0;
for(int i=1;i<=m;i++){
while(l+1<q[i].l)del(l++);
while(l+1>q[i].l)add(--l);
while(r<q[i].r)add(++r);
while(r>q[i].r)del(r--);
ans[q[i].id]=Ans;
}
for(int i=1;i<=m;i++)cout<<ans[i]<<endl;
}