/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 2ms 324.0 KiB
#2 Accepted 2ms 540.0 KiB
#3 Accepted 107ms 684.0 KiB
#4 Accepted 139ms 3.031 MiB
#5 Accepted 145ms 4.148 MiB
#6 Accepted 82ms 572.0 KiB
#7 Accepted 75ms 572.0 KiB
#8 Accepted 87ms 568.0 KiB
#9 Accepted 159ms 4.355 MiB
#10 Accepted 36ms 556.0 KiB

Code

#include <bits/stdc++.h>

using namespace std;

typedef long long LL;
typedef pair<long long,long long> PLL;

#define int long long
#define all(v) v.begin(),v.end()
#define faster {ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);}  

const LL mod = 1e9 + 7;
const int N = 2e5 + 10;
const LL inf = 1e9;

void solve(int test){
    int n; cin>>n;
    map<int, PLL> mp;
    LL ans = 0, x = 0; mp[0] = {1, 1};
    for(int i = 1; i <= n; i++){
        int u; cin>>u; x ^= u;
        auto [l, sum] = mp[x];
        ans += (1LL * l * i - sum); 
        mp[x].first++, mp[x].second += (i + 1);
    }
    cout<<ans<<'\n';
}

signed main(){
    faster
    int t = 1; 
    cin>>t;
    for(int i = 1; i <= t; i++){
        solve(i);
    }
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1096 Mr. Heart and the XOR Puzzle
Contest
Brain Booster #6
Language
C++17 (G++ 13.2.0)
Submit At
2024-10-03 16:50:40
Judged At
2024-11-11 02:47:24
Judged By
Score
100
Total Time
159ms
Peak Memory
4.355 MiB