Submission #2851640
Source Code Expand
n = int(input()) a = [] b = 0 for i in range(n): x = int(input()) b ^= x a += [x^(x-1)] ans = 0 a.sort() for x in a[::-1]: if b&((x+1)>>1): b^=x ans += 1 if b == 0: print(ans) else: print(-1)
Submission Info
Submission Time | |
---|---|
Task | C - Cheating Nim |
User | deoxy |
Language | Python (3.4.3) |
Score | 500 |
Code Size | 253 Byte |
Status | AC |
Exec Time | 288 ms |
Memory | 7836 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 | 17 ms | 3060 KB |
001.txt | AC | 17 ms | 2940 KB |
002.txt | AC | 265 ms | 7836 KB |
003.txt | AC | 163 ms | 4132 KB |
004.txt | AC | 134 ms | 3856 KB |
005.txt | AC | 90 ms | 3608 KB |
006.txt | AC | 282 ms | 7012 KB |
007.txt | AC | 280 ms | 6992 KB |
008.txt | AC | 277 ms | 7020 KB |
009.txt | AC | 276 ms | 7032 KB |
010.txt | AC | 272 ms | 7008 KB |
011.txt | AC | 278 ms | 7020 KB |
012.txt | AC | 277 ms | 7008 KB |
013.txt | AC | 276 ms | 7032 KB |
014.txt | AC | 288 ms | 7016 KB |
015.txt | AC | 278 ms | 7008 KB |
016.txt | AC | 278 ms | 7128 KB |
017.txt | AC | 275 ms | 7016 KB |
018.txt | AC | 282 ms | 7008 KB |
019.txt | AC | 275 ms | 7156 KB |
020.txt | AC | 272 ms | 7152 KB |
021.txt | AC | 41 ms | 3316 KB |
022.txt | AC | 42 ms | 3316 KB |
023.txt | AC | 261 ms | 7832 KB |
example0.txt | AC | 17 ms | 3060 KB |
example1.txt | AC | 17 ms | 2940 KB |