/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 540.0 KiB
#2 Accepted 2ms 444.0 KiB
#3 Accepted 64ms 796.0 KiB
#4 Accepted 76ms 7.352 MiB
#5 Accepted 83ms 9.098 MiB
#6 Accepted 61ms 584.0 KiB
#7 Accepted 58ms 540.0 KiB
#8 Accepted 61ms 580.0 KiB
#9 Accepted 82ms 8.816 MiB
#10 Accepted 25ms 3.258 MiB

Code

#include<bits/stdc++.h>
#define endl        '\n'
#define F           first
#define S           second
#define pb          push_back
#define yes         cout<<"YES\n"
#define no          cout<<"NO\n"
#define all(x)      x.begin(),x.end()
#define allr(x)     x.rbegin(),x.rend()
#define error1(x)   cerr<<#x<<" = "<<(x)<<endl
#define error2(a,b) cerr<<"("<<#a<<", "<<#b<<") = ("<<(a)<<", "<<(b)<<")\n";
#define coutall(v)  for(auto &it: v) cout << it << " "; cout << endl;
using namespace std;
using ll = long long;
using ld = long double;

void solve() {
    ll n, xorr = 0, ans = 0;
    cin >> n;
    vector<ll> v(n);
    map<ll, vector<int>> mp;
    mp[0].pb(-1);
    for (int i = 0; i < n; i++) {
        ll x; cin >> x;
        v[i] = x;
        xorr ^= x;
        mp[xorr].pb(i);
    }
    for(auto &[i, vec]: mp) {
        ll sum = 0;
        for(auto &j: vec) sum += j;
        ll sz = vec.size();
        for(auto &j: vec) {
            if(sz <= 1) break;
            sum -= j;
            --sz;
            ans += sum - (sz * (j + 1));
        }
    }
    cout << ans << endl;
    return;
}

signed main() {
    ios::sync_with_stdio(false); cin.tie(0);
    int tc = 1;
    cin >> tc;
    for (int t = 1; t <= tc; t++) {
        // cout << "Case " << t << ": ";
        solve();
    }
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1096 Mr. Heart and the XOR Puzzle
Language
C++17 (G++ 13.2.0)
Submit At
2024-10-05 10:21:16
Judged At
2024-10-05 10:21:16
Judged By
Score
100
Total Time
83ms
Peak Memory
9.098 MiB