CodeForces Round#340 E：XOR and Favorite Number(莫队算法)

最新推荐文章于 2022-11-22 23:15:14 发布

是橙

最新推荐文章于 2022-11-22 23:15:14 发布

阅读量376

点赞数

分类专栏：算法 CodeForces 文章标签：算法莫队区间

本文链接：https://blog.csdn.net/cg66570/article/details/52725154

版权

算法同时被 2 个专栏收录

14 篇文章 0 订阅

订阅专栏

CodeForces

3 篇文章 0 订阅

订阅专栏

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.

        Examples 
      

          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次询问li~ri区间内有几对i，j （l ≤ i ≤ j ≤ r）使得ai~aj异或总等于k。

这题用莫队算法可以过。莫队算法是离线的，可以用在不修改的询问区间的问题上。

数据挺大的会爆int 所以有些数组和变量开了ll

#include <cstdio>  
#include <cstring>  
#include <cmath>  
#include <cstdlib>  
#include <algorithm>  
#include <queue>    
#include <map>  
#include <vector>  
#include <iostream>
#define INF 0x3f3f3f3f  
#define mst(a, b) memset(a, (b), sizeof(a))  
#define MOD 100000007  
#define ll long long  
#define lson node<<1, l, mid  
#define rson node<<1|1, mid+1, r  
const  int maxn = 1<<20;
using namespace std;
struct node
{
	int l, r, id;
}Q[maxn];
int a[maxn];
int pos[maxn];
ll ans[maxn];;
ll flag[maxn];
bool 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 n, m, k;
int L = 1, R = 0;
ll  Ans = 0;
void add(int x) {
	Ans += flag[a[x] ^ k];
	flag[a[x]]++;
}
void del(int x) {
	flag[a[x]]--;
	Ans -= flag[a[x] ^ k];
}

int main() {
	scanf("%d%d%d", &n, &m, &k);
	int sz = (int)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);
	flag[0] = 1;
	for (int i = 1; i <= m; ++i) {
		while (L < Q[i].l) {
			del(L - 1);
			L++;
		}
		while (L > Q[i].l) {
			L--;
			add(L - 1);
		}
		while (R < Q[i].r) {
			R++;
			add(R);
		}
		while (R > Q[i].r) {
			del(R);
			R--;
		}
		ans[Q[i].id] = Ans;
	}
	for (int i = 1; i <= m; ++i) {
		cout << ans[i] << endl;
	}
}