Submission #6371530


Source Code Expand

Copy
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> lpair;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i = (m); i < (n); i++)
#define rrep(i,m,n) for(ll i = (m); i >= (n); i--)
#define print(x) cout << (x) << endl;
#define print2(x,y) cout << (x) << " " << (y) << endl;
#define printa(x,n) for(ll i = 0; i < n; i++){ cout << (x[i]) << " ";} cout<<endl;
int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll N;
    cin >> N;
    ll A[100010];
    rep(i,0,N) cin >> A[i];
    ll val = A[0];
    rep(i,1,N) val ^= A[i];
    if(val == 0){
        print("Yes");
    }else{
        print("No");
    }


    
}

Submission Info

Submission Time
Task A - XOR Circle
User yuji9511
Language C++14 (GCC 5.4.1)
Score 300
Code Size 709 Byte
Status AC
Exec Time 10 ms
Memory 1024 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 2
AC × 22
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
All sample_01.txt, sample_02.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt
Case Name Status Exec Time Memory
sample_01.txt AC 9 ms 764 KB
sample_02.txt AC 1 ms 256 KB
test_01.txt AC 7 ms 1024 KB
test_02.txt AC 7 ms 1024 KB
test_03.txt AC 7 ms 1024 KB
test_04.txt AC 9 ms 1024 KB
test_05.txt AC 10 ms 1024 KB
test_06.txt AC 5 ms 640 KB
test_07.txt AC 5 ms 640 KB
test_08.txt AC 4 ms 512 KB
test_09.txt AC 6 ms 640 KB
test_10.txt AC 10 ms 1024 KB
test_11.txt AC 6 ms 640 KB
test_12.txt AC 9 ms 896 KB
test_13.txt AC 8 ms 896 KB
test_14.txt AC 7 ms 768 KB
test_15.txt AC 10 ms 1024 KB
test_16.txt AC 2 ms 384 KB
test_17.txt AC 2 ms 384 KB
test_18.txt AC 3 ms 384 KB
test_19.txt AC 4 ms 640 KB
test_20.txt AC 9 ms 896 KB