Codeforces Round #340 (Div. 2) E. XOR and Favorite Number （莫队暴力）

E. 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.

Examples

input

Copy

6 2 3
1 2 1 1 0 3
1 6
3 5

output

Copy

7
0

input

Copy

5 3 1
1 1 1 1 1
1 5
2 4
1 3

output

Copy

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次查询  k  每次询问l,r区间有多少对连续的区间i,j的异或和等于k

思路：

莫队的模板题（一年前学的莫队，现在都忘干净了），至于莫队可以直接在网上百度搜搜学学，还是很简单的暴力，不带修改和回滚的莫队很好理解。我们可以先异或一次前缀和，然后记录一下数出现的个数，对于每次更新的时候扩展区间，就是ans += cnt[a[x] ^k]的个数

代码：

ll c,n,k,m;
ll a[maxn];
struct node{
    int l,r,id;
}g[maxn];
int post[maxn];
int cnt[maxn];
bool cmp(node a,node b){
    if(post[a.l] == post[b.l]) return a.r < b.r;
    return post[a.l] < post[b.l];
}bool cmp1(node a,node b){
    return a.id < b.id;
}
ll L = 1,R = 0,ans = 0;
void add(int x){
    ans += cnt[a[x] ^ k];
    cnt[a[x]]++;
//    cout << ans << endl;
    return ;
}
void del(int x){
    cnt[a[x]]--;
    ans -= cnt[a[x] ^ k];
}
ll Ans[maxn];
int main() {
     ios::sync_with_stdio(false);
    while(cin >> n >> m >> k){
        int ssize = sqrt(n);
        for(int i = 1;i <= n;i++){
            cin >> a[i];
            a[i] ^= a[i - 1];
            post[i] = i / ssize;
//            cout << a[i] << " ";
        }
//        cout << endl;
        for(int i = 1;i <= m;i++){
            cin >> g[i].l >> g[i].r;g[i].id = i;
        }
//        cout << "sss" << endl;
        ans = 0;
        sort(g + 1,g + 1 + m,cmp);
        cnt[0] = 1;
        for(int i = 1;i <= m;i++){
            while(L < g[i].l) del(L - 1),L++;
            while(L > g[i].l) L--,add(L - 1);
            while(R < g[i].r) R++,add(R);
            while(R > g[i].r) del(R),R--;
            Ans[g[i].id] = ans;
//            cout << endl;
        }
        for(int i = 1;i <= m;i++){
            cout << Ans[i] << endl;
        }
    }
    cerr << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
    return 0;
}