Submission #3045435

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>

int main() {
    long long n, ret = 0;
    std::cin >> n;
    std::vector<long long> a(n + 1), s(n + 1), x(n + 1);
    for (auto i = 1ll; i <= n; i++) {
        std::cin >> a[i];
        s[i] = s[i - 1] + a[i];
        x[i] = x[i - 1] ^ a[i];
    }

    auto prev = 1ll;
    for (auto i = 1ll; i <= n; i++) {
        for (auto r = prev; r <= n; r++) {
            if (s[r] - s[i - 1] != (x[r] ^ x[i - 1])) {
                ret += r - i;
                prev = r;
                break;
            } else if (r == n) {
                ret += n - i + 1;
                prev = n;
            }
        }
    }

    std::cout << ret << std::endl;

    return 0;
}

Submission Info

Judge Result