Submission #1070541
Source Code Expand
import sys from collections import Counter n = input() a = [int(x) for x in raw_input().split()] a.sort() if n == 1: if a[0] == 0: print 1 sys.exit() 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 sys.exit() if i&1: print 0 sys.exit() if not(i&1): if d[i] == 2: c += 1 if d[i] != 2: print 0 sys.exit() if c == (n-1)//2: print (1 << c)%(10**9+7) 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 sys.exit() if not(i&1): print 0 sys.exit() if c == n//2: print (1 << c)%(10**9+7)
Submission Info
Submission Time | |
---|---|
Task | C - Lining Up |
User | shubh |
Language | Python (2.7.6) |
Score | 300 |
Code Size | 992 Byte |
Status | AC |
Exec Time | 146 ms |
Memory | 11564 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 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 | 17 ms | 2800 KB |
sample_02.txt | AC | 18 ms | 2800 KB |
sample_03.txt | AC | 17 ms | 2800 KB |
subtask_1_invalid_01.txt | AC | 112 ms | 10116 KB |
subtask_1_invalid_02.txt | AC | 35 ms | 4848 KB |
subtask_1_max_01.txt | AC | 123 ms | 11564 KB |
subtask_1_max_02.txt | AC | 125 ms | 11564 KB |
subtask_1_max_valid_01.txt | AC | 146 ms | 11564 KB |
subtask_1_max_valid_02.txt | AC | 146 ms | 11564 KB |
subtask_1_min_valid_01.txt | AC | 18 ms | 2800 KB |
subtask_1_rand_01.txt | AC | 84 ms | 9144 KB |
subtask_1_rand_02.txt | AC | 122 ms | 10968 KB |
subtask_1_valid_01.txt | AC | 88 ms | 8968 KB |
subtask_1_valid_02.txt | AC | 43 ms | 5068 KB |