Submission #1247851

---

Source Code Expand

#include <iostream>
#include <ccomplex>
#include <vector>
#include <cassert>
#include <utility>
#include <algorithm>
#include <string>
#include <deque>
#include <queue>
#include <functional>
#include <cmath>
#include <iomanip>
#include <map>
#include <numeric>
#include <list>
#include <assert.h>
#include <math.h>
#include <valarray>
#include <stdio.h>
#include <algorithm>
#include <set>
#include <complex>
#include <list>
#include <time.h>
#include <stack>
#include <locale>
#include <clocale>
#include <ctype.h>
#include <wchar.h>

using namespace std;
typedef long long int LL;
typedef pair<long long int, long long int> pii;
typedef pair<double, double> pdd;

#define SORT(c) sort((c).begin(),(c).end())
#define BACKSORT(c) sort((c).begin(),(c).end(),std::greater<LL>())
#define FOR(i,a,b) for(LL i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

int xcomp(vector<LL>& a, vector<LL>& b) {
	return a[0] < b[0];
}

#define XSORT(c) sort((c).begin(),(c).end(),xcomp)

#define ALL(x) (x).begin(),(x).end()
LL mod = 1000000007;

LL pow2(LL x) {
	if (x == 0) {
		return 1;
	}
	else {
		return pow2(x - 1) * 2;
	}
}

LL ketasu(LL x) {
	if (x == 1) {
		return 1;
	}else
		if (x == 0) {
			return 0;
		}
		else {
			return ketasu(x / 2) + 1;
		}
}

int main() {
	LL N;
	cin >> N;
	LL vv = 0;
	vector<LL> v(N, 0);
	vector<LL> h(N, 0);
	vector<LL> ni(30, 0);
	REP(i, N) {
		cin >> v[i];
		h[i] = v[i] ^ (v[i] - 1); 
		ni[ketasu(h[i])] = 1;
		vv = vv^v[i];
	}
	LL sum=0;
	while (true) {
		if (vv == 0) {
			cout<< sum<<endl;
			break;
		}
		if (ni[ketasu(vv)] == 1) {
			vv = vv ^ (pow2(ketasu(vv)) - 1);
			sum++;
		}
		else {
			cout << -1 << endl;
			break;
		}
	}
}

Submission Info

Judge Result