C. Sasha and a Bit of Relax CF

C. Sasha and a Bit of Relax
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Sasha likes programming. Once, during a very long contest, Sasha decided that he was a bit tired and needed to relax. So he did. But since Sasha isn’t an ordinary guy, he prefers to relax unusually. During leisure time Sasha likes to upsolve unsolved problems because upsolving is very useful.

Therefore, Sasha decided to upsolve the following problem:

You have an array ?
with ? integers. You need to count the number of funny pairs (?,?) (?≤?). To check if a pair (?,?) is a funny pair, take ???=?+?−12, then if ?−?+1 is an even number and ??⊕??+1⊕…⊕????=????+1⊕????+2⊕…⊕??, then the pair is funny. In other words, ⊕ of elements of the left half of the subarray from ? to ? should be equal to ⊕ of elements of the right half. Note that ⊕

denotes the bitwise XOR operation.

It is time to continue solving the contest, so Sasha asked you to solve this task.
Input

The first line contains one integer ?
(2≤?≤3⋅105

) — the size of the array.

The second line contains ?
integers ?1,?2,…,?? (0≤??<220

) — array itself.
Output

Print one integer — the number of funny pairs. You should consider only pairs where ?−?+1

is even number.
Examples
Input
Copy

5
1 2 3 4 5

Output
Copy

1

Input
Copy

6
3 2 2 3 7 6

Output
Copy

3

Input
Copy

3
42 4 2

Output
Copy

0

Note

Be as cool as Sasha, upsolve problems!

In the first example, the only funny pair is (2,5)
, as 2⊕3=4⊕5=1

.

In the second example, funny pairs are (2,3)
, (1,4), and (3,6)

.

In the third example, there are no funny pairs.

题意

给你一个数列 求有多少区间满足

1 长度为偶数

2 前一半异或值等于后一半异或值

思路

前一半异或值等于后一半异或值 那么这个区间异或值为0 只需找前缀异或相等且长度为偶数即可

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int a[300005];
int sum[300005];
int num[(1<<20)+5][2];
int main()
{
    int n;
    scanf("%d", &n);
    for(int i = 1;i <= n;i++)
    {
        scanf("%d", &a[i]);
        sum[i] = sum[i-1]^a[i];
    }
    num[0][0]++;
    ll ans = 0;
    for(int i = 1;i <= n;i++)
    {
        ans += num[sum[i]][i&1];
        num[sum[i]][i&1]++;
    }
    printf("%lld\n",ans);
    return 0;
}