Submission #3403113

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i,n) for(int i=0;i<(int)n;++i)

int main(){
	int N;
	cin >> N;
	vector<ll> A(N);
	REP(i, N) cin >> A[i];
	vector<ll> S(N+1), X(N+1);
	S[0] = 0;
	X[0] = 0;
	REP(i, N){
		S[i+1] = S[i] + A[i];
		X[i+1] = X[i] ^ A[i];
	}

	ll res = 0;
	REP(i, N){
		int l = i;
		int u = N+1;
		while(u-l > 1){
			int m = (l+u)/2;
			if(S[m]-S[i]!=(int)(X[m]^X[i])){
				u = m;
			}else{
				l = m;
			}
		}
		res += (u - i - 1);
	}
	cout << res << endl;
    return 0;
}

Submission Info

Judge Result