Submission #4140457
Source Code Expand
N = int(input()) gr = 0 A = [] B = [0]*31 for i in range(N): A.append(int(input())) B[len(bin(A[i]^(A[i]-1)))-3] += 1 for i in range(N): gr ^= A[i] ans = 0 for i in range(31): k = 30 - i if gr & (2 ** k): if B[k] == 0: ans = -1 break else: ans += 1 gr = ~gr print(ans)
Submission Info
Submission Time | |
---|---|
Task | C - Cheating Nim |
User | hagebooi |
Language | Python (3.4.3) |
Score | 500 |
Code Size | 329 Byte |
Status | AC |
Exec Time | 293 ms |
Memory | 7104 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 | 18 ms | 3064 KB |
001.txt | AC | 18 ms | 3064 KB |
002.txt | AC | 283 ms | 7100 KB |
003.txt | AC | 174 ms | 4988 KB |
004.txt | AC | 139 ms | 4976 KB |
005.txt | AC | 97 ms | 4232 KB |
006.txt | AC | 281 ms | 7104 KB |
007.txt | AC | 284 ms | 7104 KB |
008.txt | AC | 289 ms | 7080 KB |
009.txt | AC | 281 ms | 7104 KB |
010.txt | AC | 280 ms | 7104 KB |
011.txt | AC | 293 ms | 7104 KB |
012.txt | AC | 285 ms | 7096 KB |
013.txt | AC | 283 ms | 7104 KB |
014.txt | AC | 276 ms | 7100 KB |
015.txt | AC | 289 ms | 7096 KB |
016.txt | AC | 289 ms | 7096 KB |
017.txt | AC | 279 ms | 7104 KB |
018.txt | AC | 293 ms | 7104 KB |
019.txt | AC | 284 ms | 7104 KB |
020.txt | AC | 286 ms | 7104 KB |
021.txt | AC | 42 ms | 3308 KB |
022.txt | AC | 42 ms | 3308 KB |
023.txt | AC | 280 ms | 7100 KB |
example0.txt | AC | 18 ms | 3064 KB |
example1.txt | AC | 18 ms | 3064 KB |