/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 540.0 KiB
#2 Accepted 1ms 492.0 KiB
#3 Wrong Answer 55ms 540.0 KiB
#4 Wrong Answer 56ms 2.781 MiB

Code

#include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define dbg(a,b,c,d) cerr<<a<<"  "<<b<<"  "<<c<<"  "<<d<<endl;
#define kill(a) {cout<<a<<endl;continue;}
#define KILL(a) {cout<<a<<endl;return 0;}
#define debug cerr<<"Error Found"<<endl;
#define mem(a,b) memset(a,b,sizeof(a))
#define lcm(a, b) (a/__gcd(a,b))*b
#define w(t) cin>>t;while(t--)
#define pi  2 * acos(0.0)
#define endl "\n"
int t, cs = 0;
const int mxn = 5e3 + 3, mod = 1e9 + 7;

int32_t main()
{
    //fast;
    w(t)
    {
       int n;
       cin >> n;
       int ar[n + 1];
       for(int i = 1; i <= n; i++)cin >> ar[i];
       int pre[n + 1], suf[n + 1];
       pre[1] = ar[1], suf[n] = ar[n];
       for(int i = 2, j = n - 1; i <= n; i++, j--)pre[i] = pre[i - 1] ^ ar[i], suf[j] = suf[j + 1] ^ ar[j];
       //for(int i = 1; i <= n; i++)cout << suf[i] <<" ";cout << endl;
       int ans = 0;
       for(int i = 1; i < n; i++)ans += (suf[i + 1] == pre[i]);
       cout << ans << endl;
    }
}

Information

Submit By
Type
Submission
Problem
P1096 Mr. Heart and the XOR Puzzle
Language
C++17 (G++ 13.2.0)
Submit At
2024-11-13 19:55:23
Judged At
2024-11-13 19:55:23
Judged By
Score
20
Total Time
56ms
Peak Memory
2.781 MiB