Submission #3220419
Source Code Expand
N = int(input()) A = [int(input()) for i in range(N)] diff = set() XOR = 0 for a in A: XOR ^= a diff.add(a ^ a-1) ans = 0 for k in range(29)[::-1]: if XOR & (1 << k) and 2**(k+1)-1 in diff: ans += 1 XOR = XOR ^((2 ** (k+1)) - 1) print(ans if XOR == 0 else -1)
Submission Info
Submission Time | |
---|---|
Task | C - Cheating Nim |
User | AT274 |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 307 Byte |
Status | WA |
Exec Time | 206 ms |
Memory | 7072 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | 3060 KB |
002.txt | AC | 191 ms | 7004 KB |
003.txt | AC | 124 ms | 5004 KB |
004.txt | AC | 99 ms | 5016 KB |
005.txt | AC | 67 ms | 4256 KB |
006.txt | WA | 198 ms | 7064 KB |
007.txt | AC | 195 ms | 7072 KB |
008.txt | WA | 203 ms | 7068 KB |
009.txt | WA | 193 ms | 7072 KB |
010.txt | AC | 199 ms | 7072 KB |
011.txt | WA | 189 ms | 7072 KB |
012.txt | AC | 200 ms | 7068 KB |
013.txt | AC | 192 ms | 7072 KB |
014.txt | AC | 206 ms | 7064 KB |
015.txt | AC | 205 ms | 7072 KB |
016.txt | AC | 188 ms | 7072 KB |
017.txt | AC | 190 ms | 7064 KB |
018.txt | AC | 191 ms | 7068 KB |
019.txt | AC | 203 ms | 7072 KB |
020.txt | AC | 190 ms | 7068 KB |
021.txt | AC | 32 ms | 3316 KB |
022.txt | AC | 34 ms | 3316 KB |
023.txt | AC | 194 ms | 7072 KB |
example0.txt | AC | 17 ms | 3060 KB |
example1.txt | AC | 17 ms | 3064 KB |