Submission #1387665
Source Code Expand
# -*- coding: utf-8 -*- import numpy as np from collections import Counter mo = 1000000007 r = range n = int(input()) a = np.array(list(map(int, input().split()))) c = Counter(a.tolist()) if n % 2 == 1 and (0 not in c or c[0] != 1): print(0); exit(); for i in r(n//2): x = i * 2 + (1 if n % 2 == 0 else 2) if x not in c or c[x] != 2: print(0); exit(); print(2 ** (n//2) % mo)
Submission Info
Submission Time | |
---|---|
Task | C - Lining Up |
User | hamko |
Language | Python (3.4.3) |
Score | 300 |
Code Size | 407 Byte |
Status | AC |
Exec Time | 222 ms |
Memory | 23392 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 | 164 ms | 13344 KB |
sample_02.txt | AC | 148 ms | 12400 KB |
sample_03.txt | AC | 148 ms | 12400 KB |
subtask_1_invalid_01.txt | AC | 184 ms | 21320 KB |
subtask_1_invalid_02.txt | AC | 156 ms | 13920 KB |
subtask_1_max_01.txt | AC | 198 ms | 23392 KB |
subtask_1_max_02.txt | AC | 197 ms | 22976 KB |
subtask_1_max_valid_01.txt | AC | 222 ms | 23392 KB |
subtask_1_max_valid_02.txt | AC | 220 ms | 23392 KB |
subtask_1_min_valid_01.txt | AC | 147 ms | 12400 KB |
subtask_1_rand_01.txt | AC | 175 ms | 18992 KB |
subtask_1_rand_02.txt | AC | 191 ms | 22076 KB |
subtask_1_valid_01.txt | AC | 187 ms | 17832 KB |
subtask_1_valid_02.txt | AC | 162 ms | 14176 KB |