Submission #8000661
Source Code Expand
N = int(input()) A = [int(i) for i in input().split()] #並びが可能なら、2**(N//2) #無理なら0 opt = {} for i in range(N): a = abs((N-i-1)-i) if a not in opt : opt[a] = 1 else : opt[a] += 1 for i in range(N): if A[i] not in opt: print(0) exit() if opt[A[i]] == 0 : print(0) exit() opt[A[i]] -= 1 print(2**(N//2))
Submission Info
Submission Time | |
---|---|
Task | C - Lining Up |
User | minase_1224 |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 379 Byte |
Status | WA |
Exec Time | 136 ms |
Memory | 14500 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | 108 ms | 12340 KB |
subtask_1_invalid_02.txt | AC | 34 ms | 4852 KB |
subtask_1_max_01.txt | AC | 84 ms | 13880 KB |
subtask_1_max_02.txt | AC | 85 ms | 13880 KB |
subtask_1_max_valid_01.txt | WA | 136 ms | 14500 KB |
subtask_1_max_valid_02.txt | WA | 135 ms | 13880 KB |
subtask_1_min_valid_01.txt | AC | 17 ms | 3064 KB |
subtask_1_rand_01.txt | AC | 58 ms | 9996 KB |
subtask_1_rand_02.txt | AC | 81 ms | 13732 KB |
subtask_1_valid_01.txt | WA | 82 ms | 8988 KB |
subtask_1_valid_02.txt | WA | 40 ms | 5360 KB |