Submission #3728743

---

Source Code Expand

#include<map>
#include<set>
#include<bitset>
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<string>
#include<chrono>
#include<stack>
#include<fstream>
#include<list>
#define REP(i,x,y) for(ll i=x;i<=y;i++)
#define SIZE(a) ll(a.size())
#define vll vector<ll> 
#define MEMSET(a, n, m) for(ll i=0;i<=n;i++) a[i] = m
#define BIT(n) (ll(1)<<n)
#define UNIQUE(v) v.erase(unique(v.begin(),v.end()),v.end()) 
#define UNIQUE_ARRAY(a,n) n = unique(a + 1, a + x + 1) - a - 1
#define SORT(a,n) sort(a+1,a+n+1)
#define SORT_O(a,n,order) sort(a+1,a+n+1,order)
#define PER(i,y,x) for(ll i=y;i>=x;i--)
typedef long long ll;
using namespace std;


struct point
{
	long long name; long long dist;
bool operator<(const point& rhs) const {
return dist > rhs.dist;
}
};

ll const MAX = 100005;
ll a[MAX], b[MAX] = {};

int main(){
	ll n;
	cin >> n;
	ll x = 0;
	REP(i, 1, n) {
		cin >> a[i];
		x ^= a[i];
	}
	ll ans = 0;
	REP(i, 1, n) {
		ll u = 1;
		ll v = a[i];
		while ((v & 1) == 0) {
			u++;
			v /= 2;
		}
		b[i] = u;
		//cout << i << " " << b[i] << endl;
	}
	while (x > 0) {
		ll y = x;
		ll u = 0;
		while (y > 0) {
			u++;
			y /= 2;
		}
		//cout << x << " ! " << u  << endl;
		bool flag = 1;
		REP(i, 1, n) {
			if (u == b[i]) {
				x ^= a[i];
				x ^= (a[i] - 1);
				//cout << i << " " <<x << endl;
				b[i] = -1;
				ans++;
				flag = 0;
				break;
			}
		}
		if (flag == 1) {
			cout << -1 << endl;
			return 0;
		}
		
	}	
	cout << ans << endl;

}

Submission Info

Judge Result