Submission #1833583

---

Source Code Expand

#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "iomanip"
#include "cmath"

using namespace std;

const long long int MOD = 1000000007;

long long int N, M, K, H, W, L, R;

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);

	cin >> N;
	vector<long long int>v(N);
	for (int i = 0; i < N; i++) {
		cin >> v[i];
		M ^= v[i];
	}
	for (int i = 30; i >=0; i--) {
		if (M >> i & 1) {
			bool flag = false;
			for (int j = 0; j < N; j++) {
				if (v[j] % (int)pow(2, i) == 0 && v[j] % (int)pow(2, i + 1)) {
					flag = true;
				}
			}
			if (!flag) {
				cout << "-1\n";
				return 0;
			}
			M ^= (int)pow(2, i);
			M ^= (int)(pow(2, i) - 1);
			K++;
		}
	}
	if (!M) {
		cout << K << endl;
	}
	else {
		cout << "-1\n";
	}
	return 0;
}

Submission Info

Judge Result