Submission #1070529
Source Code Expand
from collections import Counter n = input() a = [int(x) for x in raw_input().split()] a.sort() c = 0 if n&1: if a[0] == 0: del a[0] d = Counter(a) for i in d.keys(): if i == 0: print 0 exit(1) if i&1: print 0 exit(1) if not(i&1): if d[i] == 2: c += 1 if d[i] != 2: print 0 exit(1) if c == (n-1)//2: print 1 << c if not(n&1): d = Counter(a) for i in d.keys(): if i&1: if d[i] == 2: c +=1 if d[i] != 2: print 0 exit(1) if not(i&1): print 0 exit(1) if c == n//2: print 1 << c
Submission Info
Submission Time | |
---|---|
Task | C - Lining Up |
User | shubh |
Language | Python (2.7.6) |
Score | 0 |
Code Size | 877 Byte |
Status | WA |
Exec Time | 153 ms |
Memory | 11508 KB |
Judge Result
Set Name | Sample | All | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 300 | ||||||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | subtask_1_invalid_01.txt, subtask_1_invalid_02.txt, subtask_1_max_01.txt, subtask_1_max_02.txt, subtask_1_max_valid_01.txt, subtask_1_max_valid_02.txt, subtask_1_min_valid_01.txt, subtask_1_rand_01.txt, subtask_1_rand_02.txt, subtask_1_valid_01.txt, subtask_1_valid_02.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 26 ms | 3320 KB |
sample_02.txt | RE | 17 ms | 2808 KB |
sample_03.txt | AC | 17 ms | 2808 KB |
subtask_1_invalid_01.txt | RE | 105 ms | 10188 KB |
subtask_1_invalid_02.txt | RE | 35 ms | 4764 KB |
subtask_1_max_01.txt | RE | 123 ms | 11508 KB |
subtask_1_max_02.txt | RE | 123 ms | 11508 KB |
subtask_1_max_valid_01.txt | WA | 153 ms | 11508 KB |
subtask_1_max_valid_02.txt | WA | 150 ms | 11508 KB |
subtask_1_min_valid_01.txt | AC | 17 ms | 2808 KB |
subtask_1_rand_01.txt | RE | 85 ms | 9088 KB |
subtask_1_rand_02.txt | RE | 119 ms | 11040 KB |
subtask_1_valid_01.txt | WA | 89 ms | 8912 KB |
subtask_1_valid_02.txt | WA | 44 ms | 5112 KB |