Submission #7063011
Source Code Expand
import sys MOD = 1000000007 N = int(input()) a = list(map(int,input().split())) if(N%2 == 0): a.sort() for i in range(N//2): n = 2*i + 1 if(a[2*i] != n or a[2*i + 1] != n): print(0) sys.exit() print((2 ** (N//2)) % MOD) else: a.sort() if(a.count(0) != 1): print(0) sys.exit() for i in range((N-1)//2): n = 2*i + 2 if(a[2*i + 1] != n or a[2*i + 2] != n): print(0) sys.exit() print((2 ** ((N-1)//2)) % MOD)
Submission Info
Submission Time | |
---|---|
Task | C - Lining Up |
User | T_Wakasugi |
Language | Python (3.4.3) |
Score | 300 |
Code Size | 558 Byte |
Status | AC |
Exec Time | 96 ms |
Memory | 14008 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 | 68 ms | 12172 KB |
subtask_1_invalid_02.txt | AC | 27 ms | 4852 KB |
subtask_1_max_01.txt | AC | 76 ms | 13808 KB |
subtask_1_max_02.txt | AC | 76 ms | 13812 KB |
subtask_1_max_valid_01.txt | AC | 96 ms | 14008 KB |
subtask_1_max_valid_02.txt | AC | 95 ms | 14008 KB |
subtask_1_min_valid_01.txt | AC | 17 ms | 3064 KB |
subtask_1_rand_01.txt | AC | 51 ms | 9580 KB |
subtask_1_rand_02.txt | AC | 71 ms | 13352 KB |
subtask_1_valid_01.txt | AC | 58 ms | 8892 KB |
subtask_1_valid_02.txt | AC | 32 ms | 5236 KB |