链接
题解
被越界搞得头皮发麻…
s i s_i si表示前缀异或和
那么就是找 l − 1 ≤ i < j ≤ r l-1 \leq i < j \leq r l−1≤i<j≤r且 s i x o r s j = k s_i\ xor\ s_j=k si xor sj=k
统计每种数字的数量然后莫队即可
代码
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define iinf 0x3f3f3f3f
#define linf (1ll<<60)
#define eps 1e-8
#define maxn 5000010
#define cl(x) memset(x,0,sizeof(x))
#define rep(_,__) for(_=1;_<=(__);_++)
#define em(x) emplace(x)
#define emb(x) emplace_back(x)
#define emf(x) emplace_front(x)
#define fi first
#define se second
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll read(ll x=0)
{
ll c, f(1);
for(c=getchar();!isdigit(c);c=getchar())if(c=='-')f=-f;
for(;isdigit(c);c=getchar())x=x*10+c-0x30;
return f*x;
}
ll l[maxn], r[maxn], ans[maxn], id[maxn], n, cnt[maxn], a[maxn], m, k, S=320, now;
void upd(ll x, ll opt)
{
if(k==0)
{
if(opt==1)now+=cnt[a[x]];
else now-=cnt[a[x]]-1;
cnt[a[x]]+=opt;
return;
}
now+=opt*cnt[a[x]^k];
cnt[a[x]]+=opt;
}
int main()
{
ll i, L, R;
n=read(), m=read(), k=read();
rep(i,n)a[i]=read()^a[i-1];
rep(i,m)l[i]=read()-1, r[i]=read(), id[i]=i;
sort(id+1,id+m+1,[](ll a, ll b){if(l[a]/S==l[b]/S)return r[a]<r[b];return l[a]/S<l[b]/S;});
L=1, R=1;
cnt[a[1]]=1;
rep(i,m)
{
for(;L>l[id[i]];L--)upd(L-1,+1);
for(;R<r[id[i]];R++)upd(R+1,+1);
for(;L<l[id[i]];L++)upd(L,-1);
for(;R>r[id[i]];R--)upd(R,-1);
ans[id[i]]=now;
}
rep(i,m)printf("%lld\n",ans[i]);
return 0;
}