Submission #2408513

---

Source Code Expand

#include <iostream>
#include <string>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <map>
#include <cmath>
#include <queue>
#include <utility>
#include <functional>
#include <deque>
#include <cctype>
#include <stack>
#include <bitset>
#include <set>
 
using ll = long long;
using namespace std;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
 
const ll MOD = 1000000007;
const ll INF = 1 << 30;
const ll INF2 = 9000000000000000000LL;
const double INF3 = 900000000000000;
const int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 };
const int tx[8] = { -1,0,1,-1,1,-1,0,1 }, ty[8] = { -1,-1,-1,0,0,1,1,1 };
#define ALL(x) (x).begin(),(x).end()
 
int main(){
 int n,a,bit[50]={0},ans=0;
cin>>n;
for(int i=0;i<n;i++){
cin>>a;
for(int j=0;j<=33;j++){
if(a&(1<<j))bit[j]++;
}
} 


for(int i=33;i>=1;i--){
if(bit[i]==0)continue;
if(bit[i]%2==1){
ans++;
for(int j=i;j>=0;j--)bit[j]=max(0,bit[j]-1);
}
}

for(int i=0;i<=33;i++){
if(bit[i]%2==1){
cout<<-1<<endl;
return 0;
}
}
cout<<ans<<endl;
}

Submission Info

Judge Result