Submission #3306429
Source Code Expand
#include <iostream> #include <stdio.h> #include <fstream> #include <algorithm> #include <string> #include <map> #include <set> #include <queue> #include <stack> #include <vector> #include <limits.h> #include <math.h> #include <functional> #include <bitset> #define repeat(i,n) for (long long i = 0; (i) < (n); ++ (i)) #define debug(x) cerr << #x << ": " << x << '\n' #define debugArray(x,n) for(long long i = 0; (i) < (n); ++ (i)) cerr << #x << "[" << i << "]: " << x[i] << '\n' #define debugArrayP(x,n) for(long long i = 0; (i) < (n); ++ (i)) cerr << #x << "[" << i << "]: " << x[i].first<< " " << x[i].second << '\n' using namespace std; typedef long long ll; typedef pair<int,int> Pii; typedef vector<int> vint; typedef vector<ll> vll; const ll INF = LLONG_MAX/10; const ll MOD = 1e9+7; int main(){ int N;cin>>N; vint a(N); int xa=0; repeat(i,N){ cin>>a[i]; xa ^= a[i]; a[i] ^= a[i]-1; } debug(xa); debugArray(a,N); ll ans=0; sort(a.begin(),a.end()); for(int i=31;i>=0;i--){ if(!((xa>>i)&1))continue; int j=lower_bound(a.begin(),a.end(),(1<<i))-a.begin(); if(a[j]!=(1<<(i+1))-1){ ans = -1; break; } ans++; xa ^= a[j]; } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Cheating Nim |
User | hashiryo |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 1291 Byte |
Status | AC |
Exec Time | 285 ms |
Memory | 640 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 500 / 500 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | example0.txt, example1.txt |
All | 000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, 011.txt, 012.txt, 013.txt, 014.txt, 015.txt, 016.txt, 017.txt, 018.txt, 019.txt, 020.txt, 021.txt, 022.txt, 023.txt, example0.txt, example1.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
000.txt | AC | 1 ms | 256 KB |
001.txt | AC | 1 ms | 256 KB |
002.txt | AC | 276 ms | 640 KB |
003.txt | AC | 170 ms | 512 KB |
004.txt | AC | 127 ms | 384 KB |
005.txt | AC | 82 ms | 384 KB |
006.txt | AC | 277 ms | 640 KB |
007.txt | AC | 278 ms | 640 KB |
008.txt | AC | 280 ms | 640 KB |
009.txt | AC | 279 ms | 640 KB |
010.txt | AC | 277 ms | 640 KB |
011.txt | AC | 276 ms | 640 KB |
012.txt | AC | 277 ms | 640 KB |
013.txt | AC | 277 ms | 640 KB |
014.txt | AC | 277 ms | 640 KB |
015.txt | AC | 280 ms | 640 KB |
016.txt | AC | 277 ms | 640 KB |
017.txt | AC | 276 ms | 640 KB |
018.txt | AC | 276 ms | 640 KB |
019.txt | AC | 285 ms | 640 KB |
020.txt | AC | 278 ms | 640 KB |
021.txt | AC | 26 ms | 256 KB |
022.txt | AC | 27 ms | 256 KB |
023.txt | AC | 275 ms | 640 KB |
example0.txt | AC | 1 ms | 256 KB |
example1.txt | AC | 1 ms | 256 KB |