Submission #1000608

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define all(c) c.begin(),c.end()
#define pb push_back
#define fs first
#define sc second
#define show(x) cout << #x << " = " << x << endl
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
using namespace std;
template<class S,class T> ostream& operator<<(ostream& o,const pair<S,T> &p){return o<<"("<<p.fs<<","<<p.sc<<")";}
template<class T> ostream& operator<<(ostream& o,const vector<T> &vc){o<<"sz = "<<vc.size()<<endl<<"[";for(const T& v:vc) o<<v<<",";o<<"]";return o;}
bool B(int a,int i){return (a>>i)&1;}
bool b[32];
int main(){
	int N;
	cin>>N;
	int x=0;
	rep(i,N){
		int a;
		cin>>a;
		x^=a;
		int j=0;
		while(!B(a,j)) j++;
		b[j]=1;
	}
	int a=0;
	for(int i=30;i>=0;i--){
		if(B(x,i+1)!=B(x,i)){
			if(!b[i]){
				puts("-1");
				return 0;
			}
			a++;
		}
	}
	cout<<a<<endl;
}

Submission Info

Judge Result