/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 532.0 KiB
#2 Accepted 1ms 532.0 KiB
#3 Wrong Answer 99ms 788.0 KiB
#4 Wrong Answer 127ms 6.523 MiB
#5 Wrong Answer 156ms 7.574 MiB
#6 Wrong Answer 85ms 532.0 KiB
#7 Wrong Answer 84ms 536.0 KiB
#8 Wrong Answer 110ms 532.0 KiB
#9 Wrong Answer 131ms 7.52 MiB
#10 Wrong Answer 23ms 3.566 MiB

Code

#ifndef LOCAL
#include <bits/stdc++.h>
#define debug(...)
#endif

using namespace std;
#define int long long
#define cinv(v) for (auto &it:v) cin>>it;
#define coutv(v) for (auto &it:v) cout<< it<<' '; cout<<'\n';

void shelby() {
    int n;
    cin >> n;
    vector<int> v(n);
    cinv(v)
    vector<int> suff(n);
    map<int,int> mp;
    mp[suff.back() = v.back()]++;
    for (int i = n - 2; i >= 0; --i) suff[i] = suff[i + 1] ^ v[i], mp[suff[i]]++;
    debug(suff, mp);
    int ans = 0, now = 0;
    for (int i = 0; i < n; ++i) {
        mp[suff[i]]--;
        now ^= v[i];
        ans += mp[now];
    }
    cout << ans << '\n';
}

signed main() {
    cin.tie(0)->sync_with_stdio(0);
    int t = 1;
    cin >> t;
    for (int _ = 1; _ <= t; ++_) {
        // cout << "Case " << _ << ": ";
        shelby();
    }
}

Information

Submit By
Type
Submission
Problem
P1096 Mr. Heart and the XOR Puzzle
Language
C++17 (G++ 13.2.0)
Submit At
2024-10-04 19:12:13
Judged At
2024-10-04 19:12:13
Judged By
Score
20
Total Time
156ms
Peak Memory
7.574 MiB