Submission #1244549


Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <sstream>
#include <cmath>
#include <set>
#include <iomanip>
#include <deque>
#include <stdio.h>
#include <fstream>
using namespace std;

#define REP(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define RREP(i,n) for(int (i)=(int)(n)-1;i>=0;i--)
#define REMOVE(Itr,n) (Itr).erase(remove((Itr).begin(),(Itr).end(),n),(Itr).end())
#define UNIQUE(Itr) sort((Itr).begin(),(Itr).end()); (Itr).erase(unique((Itr).begin(),(Itr).end()),(Itr).end())
#define LBOUND(Itr,val) lower_bound((Itr).begin(),(Itr).end(),(val))
#define UBOUND(Itr,val) upper_bound((Itr).begin(),(Itr).end(),(val))
typedef long long ll;
#define MOD 1000000007

int judge(int n) {
    ll t = 2;
    REP(i,30) {
        if((t<<i)-1 == n) return i;
    }
    return -1;
}

int main() {
    
    int N; cin >> N;
    vector<int> a(N);
    REP(i,N) cin >> a[i];
    
    int x = 0;
    REP(i,N) x ^= a[i];
    
    bool exist[32];
    REP(i,32) exist[i] = false;
    
    REP(i,N) {
        int t = a[i] ^ (a[i] - 1);
        if(judge(t) != -1) exist[judge(t)] = true;
    }
    
    int cnt = 0;
    for(int i=30;i>=0;i--) {
        if((x>>i)&1) {
            if(exist[i]) {
                x ^= ((2<<i)-1);
                cnt++;
            }
        }
    }
    
    if(x == 0) cout << cnt << endl;
    else cout << -1 << endl;
    
    return 0;
}

Submission Info

Submission Time
Task A - 1D Matching
User kosakkun
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1506 Byte
Status WA
Exec Time 43 ms
Memory 640 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 500
Status
AC × 1
WA × 1
AC × 1
WA × 13
Set Name Test Cases
Sample example0.txt, example1.txt
All 000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, 011.txt, example0.txt, example1.txt
Case Name Status Exec Time Memory
000.txt WA 26 ms 512 KB
001.txt WA 11 ms 384 KB
002.txt WA 13 ms 384 KB
003.txt WA 15 ms 384 KB
004.txt WA 37 ms 640 KB
005.txt WA 41 ms 640 KB
006.txt WA 41 ms 640 KB
007.txt WA 41 ms 640 KB
008.txt WA 42 ms 640 KB
009.txt WA 42 ms 640 KB
010.txt WA 43 ms 640 KB
011.txt WA 42 ms 640 KB
example0.txt WA 1 ms 256 KB
example1.txt AC 1 ms 256 KB