Submission #1180210
Source Code Expand
# coding: utf-8 num_N = int(input()) l_num = list(map(int, input().split())) l_num.sort() num_div = num_N // 2 if num_N % 2 == 1: l_cor = [0] for i in range(1, num_div + 1): l_cor.append(i * 2) l_cor.append(i * 2) else: l_cor = [] for i in range(1, num_div + 1): l_cor.append(2 * i - 1) l_cor.append(2 * i - 1) if l_num == l_cor: print((2 ** num_div) % (10 ** 9 + 7)) else: print(0)
Submission Info
Submission Time | |
---|---|
Task | C - Lining Up |
User | ch000k111 |
Language | Python (3.4.3) |
Score | 300 |
Code Size | 466 Byte |
Status | AC |
Exec Time | 96 ms |
Memory | 13812 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 | 3060 KB |
sample_02.txt | AC | 18 ms | 3064 KB |
sample_03.txt | AC | 17 ms | 3064 KB |
subtask_1_invalid_01.txt | AC | 77 ms | 12172 KB |
subtask_1_invalid_02.txt | AC | 29 ms | 4852 KB |
subtask_1_max_01.txt | AC | 93 ms | 13812 KB |
subtask_1_max_02.txt | AC | 93 ms | 13812 KB |
subtask_1_max_valid_01.txt | AC | 96 ms | 13812 KB |
subtask_1_max_valid_02.txt | AC | 95 ms | 13812 KB |
subtask_1_min_valid_01.txt | AC | 17 ms | 3064 KB |
subtask_1_rand_01.txt | AC | 61 ms | 9580 KB |
subtask_1_rand_02.txt | AC | 86 ms | 12848 KB |
subtask_1_valid_01.txt | AC | 57 ms | 8904 KB |
subtask_1_valid_02.txt | AC | 31 ms | 5272 KB |