Submission #1680019

---

Source Code Expand

// 基本テンプレート

#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
using namespace std;

#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)
#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)
#define int long long int

template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}

typedef pair<int, int> pii;
typedef long long ll;

int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
constexpr ll INF = 1001001001001001LL;
constexpr ll MOD = 1000000007LL;

signed main() {
    int N; cin >> N;
    int XOR = 0;
    vector<int> v[40];
    rep(i,0,N) {
        int p; cin >> p;
        XOR ^= p;
        int LSB = p & (-p);
        int put = 0;
        while(LSB != 1) put++, LSB >>= 1;
        v[put].push_back(p);
    }

    int cnt = 0;
    repr(i,35,0) {
        if(XOR >> i & 1) {
            if(v[i].size() == 0) {
                cout << -1 << endl;
                return 0;
            }
            else {
                int p = v[i][0];
                XOR = XOR ^ p ^ (p-1);
                cnt++;
            }
        }
    }
    cout << cnt << endl;
    return 0;
}

Submission Info

Judge Result