Codeforces Round #340 (Div. 2) E. XOR and Favorite Number 莫队算法
2016-04-28 22:40
441 查看
[b]E. XOR and Favorite Number[/b]
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.
[b]Input[/b]
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.
[b]Output[/b]
Print m lines, answer the queries in the order they appear in the input.
[b]Examples[/b]
[b]input[/b]
[b]output[/b]
[b]Note[/b]
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.
[b]题意:[/b]
给你一个长度为n的序列
m个询问,每次询问你l,r之间有多少对子区间的异或和等于k
[b]题解:[/b]
怼一波莫队
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.
[b]Input[/b]
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.
[b]Output[/b]
Print m lines, answer the queries in the order they appear in the input.
[b]Examples[/b]
[b]input[/b]
6 2 3 1 2 1 1 0 3 1 6 3 5
[b]output[/b]
7 0
[b]Note[/b]
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.
[b]题意:[/b]
给你一个长度为n的序列
m个询问,每次询问你l,r之间有多少对子区间的异或和等于k
[b]题解:[/b]
怼一波莫队
#include<bits/stdc++.h> using namespace std; const int N = 1e6+10, M = 5e6+10, inf = 1e9+7, mod = 1e9+7; int H[M]; int sum ,n,m,k,a ,pos ; long long an ,ans; struct ss{int l,r,id;}q ; int cmp(ss s1,ss s2) {if(pos[s1.l]==pos[s2.l]) return s1.r<s2.r;else return s1.l<s2.l;} int cmpl(ss s1,ss s2) {return s1.id<s2.id;} void update(int p,int add) { if(add==-1) { H[sum[p]]--; ans -= H[sum[p]^k]; } else { ans += H[sum[p]^k]; H[sum[p]]++; } } int main() { scanf("%d%d%d",&n,&m,&k); for(int i=1;i<=n;i++) scanf("%d",&a[i]); H[0] = 1; for(int i=1;i<=n;i++) sum[i] = sum[i-1] ^ a[i]; for(int i=1;i<=m;i++) { scanf("%d%d",&q[i].l,&q[i].r); q[i].id = i; } int block = (int)sqrt((double) n + 0.5); for(int i=1;i<=n;i++) pos[i] = (i-1)/block + 1; sort(q+1,q+m+1,cmp); for(int i=1,l=1,r=0;i<=m;i++) { for(;r<q[i].r;r++) update(r+1,1); for(;l>q[i].l;l--) update(l-2,1); for(;r>q[i].r;r--) update(r,-1); for(;l<q[i].l;l++) update(l-1,-1); an[q[i].id] = ans; } for(int i=1;i<=m;i++) printf("%I64d\n",an[i]); return 0; }
相关文章推荐
- leetcode-338. Counting Bits
- python rforward.py
- IO中同步、异步与阻塞、非阻塞的区别
- 浏览器内核、缓存的介绍第二部分
- HDOJ 1325 Is It A Tree?
- VS常用快捷键大全
- idea新建maven项目,create from archetype一直loading
- 在UIImageView上添加按钮无响应的解决方法
- opencv--读取摄像头识别人脸并跟踪
- 七、状态设计模式
- 01-css
- genymotion 登录出现 Proxy ununreachable
- Hadoop2.7.2源码在64位Centos Linux下编译
- 最小生成树prim算法实现
- js检测IE浏览器版本
- 谷歌浏览器调试保存到文件
- android studio学习----gradle多渠道打包
- 练习三 1015
- BZOJ 3522|POI 2014|Hotel|树形DP
- OpenCV人脸跟踪canny边缘检测