Submission #2711349

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
typedef double db;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define pw(x) (1ll << (x))
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define rep(i,l,r) for(int i=(l);i<(r);++i)
#define per(i,l,r) for(int i=(r)-1;i>=(l);--i)
#define dd(x) cout << #x << " = " << (x) << ", "
#define de(x) cout << #x << " = " << (x) << "\n"
#define endl "\n"

//-----
const int N = 2e5 + 7;
int n, a[N];
ll sadd[N], sxor[N];
int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(0);
	cin >> n; 
	rep(i, 1, n + 1) {
		cin >> a[i];
		sxor[i] = sxor[i - 1] ^ a[i];
		sadd[i] = sadd[i - 1] + a[i];
	}
	int beg = 0;
	ll ans = 0;
	rep(i, 1, n + 1) {
		while ((sxor[i] ^ sxor[beg]) != (sadd[i] - sadd[beg])) beg++;
		ans += i - beg;
	}
	cout << ans;
	return 0;
}

Submission Info

Judge Result