Submission #3617111
Source Code Expand
import sys n = int(input()) a = list(map(int, input().split())) a.sort() ra = a.copy() a = a[0::2] ra = ra[1::2] ra.reverse() a = ra + a for i in range(n): if a[i] != abs(n - 1 - i * 2): print(0) sys.exit(0) print(2 ** (n // 2) % 1000000007)
Submission Info
Submission Time | |
---|---|
Task | C - Lining Up |
User | mashinosatoshi |
Language | Python (3.4.3) |
Score | 300 |
Code Size | 276 Byte |
Status | AC |
Exec Time | 100 ms |
Memory | 14004 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 | sample_01.txt, sample_02.txt, sample_03.txt, 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 | 3064 KB |
sample_02.txt | AC | 17 ms | 3064 KB |
sample_03.txt | AC | 17 ms | 3064 KB |
subtask_1_invalid_01.txt | AC | 69 ms | 12212 KB |
subtask_1_invalid_02.txt | AC | 26 ms | 4852 KB |
subtask_1_max_01.txt | AC | 80 ms | 14004 KB |
subtask_1_max_02.txt | AC | 81 ms | 13880 KB |
subtask_1_max_valid_01.txt | AC | 100 ms | 13812 KB |
subtask_1_max_valid_02.txt | AC | 100 ms | 13812 KB |
subtask_1_min_valid_01.txt | AC | 17 ms | 3064 KB |
subtask_1_rand_01.txt | AC | 53 ms | 9576 KB |
subtask_1_rand_02.txt | AC | 74 ms | 13096 KB |
subtask_1_valid_01.txt | AC | 60 ms | 8908 KB |
subtask_1_valid_02.txt | AC | 33 ms | 5236 KB |