Submission #1966982
Source Code Expand
import numpy as np N=int(input()) K_lst=([int(_) for _ in input().split()]) ans_lst=[K_lst[0]] isLeft=True for K in K_lst[1:]: if isLeft: if K <= ans_lst[-1]: ans_lst.append(K) else: isLeft=False ans_lst.append(1) ans_lst.append(K) else: if K == ans_lst[-1]: isLeft=True else: assert K >= ans_lst[-1] ans_lst.append(K) if isLeft: ans_lst.append(1) ans_lst=[str(_) for _ in ans_lst] print(" ".join(ans_lst))
Submission Info
Submission Time | |
---|---|
Task | B - 積み鉛筆 |
User | m2ku |
Language | Python (3.4.3) |
Score | 80 |
Code Size | 564 Byte |
Status | AC |
Exec Time | 264 ms |
Memory | 24868 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 80 / 80 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample1.txt, sample2.txt, sample3.txt |
All | sample1.txt, sample2.txt, sample3.txt, subtask0_0.txt, subtask0_1.txt, subtask0_10.txt, subtask0_11.txt, subtask0_12.txt, subtask0_13.txt, subtask0_14.txt, subtask0_2.txt, subtask0_3.txt, subtask0_4.txt, subtask0_5.txt, subtask0_6.txt, subtask0_7.txt, subtask0_8.txt, subtask0_9.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample1.txt | AC | 264 ms | 18512 KB |
sample2.txt | AC | 150 ms | 12496 KB |
sample3.txt | AC | 149 ms | 12412 KB |
subtask0_0.txt | AC | 210 ms | 23692 KB |
subtask0_1.txt | AC | 218 ms | 24196 KB |
subtask0_10.txt | AC | 212 ms | 23148 KB |
subtask0_11.txt | AC | 216 ms | 24020 KB |
subtask0_12.txt | AC | 209 ms | 23360 KB |
subtask0_13.txt | AC | 220 ms | 23344 KB |
subtask0_14.txt | AC | 217 ms | 24304 KB |
subtask0_2.txt | AC | 202 ms | 21588 KB |
subtask0_3.txt | AC | 208 ms | 22912 KB |
subtask0_4.txt | AC | 217 ms | 23536 KB |
subtask0_5.txt | AC | 205 ms | 22228 KB |
subtask0_6.txt | AC | 209 ms | 22824 KB |
subtask0_7.txt | AC | 207 ms | 21968 KB |
subtask0_8.txt | AC | 212 ms | 23532 KB |
subtask0_9.txt | AC | 216 ms | 24868 KB |