/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 540.0 KiB
#2 Accepted 2ms 332.0 KiB
#3 Wrong Answer 84ms 712.0 KiB
#4 Wrong Answer 307ms 8.176 MiB
#5 Wrong Answer 219ms 9.941 MiB
#6 Wrong Answer 70ms 576.0 KiB
#7 Wrong Answer 68ms 788.0 KiB
#8 Accepted 91ms 588.0 KiB
#9 Wrong Answer 228ms 10.605 MiB
#10 Wrong Answer 27ms 3.789 MiB

Code

#include<bits/stdc++.h>
#define iamspeed ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl '\n'
using namespace std;
typedef long long int ll;
const ll modd=1e9+7;
const ll N=1e6+5;
ll x,y,z,n,m,k,w,sum,ans,cnt,cnt2,res,mn,mx,t,tt,q,i,j;
string s,ss;
int main()
{
    iamspeed


    for(cin>>t; t--;)
    {
        cin>>n;
        vector<ll>a(n+1),pref(n+1);
        map<ll,ll>mp,prev;
        ll xr=0;
        for(i=1; i<=n; i++)
        {
            cin>>a[i];
            xr^=a[i];
            pref[i]=xr;
            prev[xr]=-1;
        }
        prev[0]=0;
        ans=cnt=0;
        for(i=1; i<=n; i++)
        {
            if(prev[pref[i]]!=-1)
            {
                mp[pref[i]]+=(i-prev[pref[i]]-1);
                ans+=mp[pref[i]];
            }
            prev[pref[i]]=i;
        }
        cout<<ans<<endl;

    }



    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 17:43:01
Judged At
2024-10-03 17:43:01
Judged By
Score
30
Total Time
307ms
Peak Memory
10.605 MiB