Submission #1150205
Source Code Expand
N=int(input()) K=[int(i) for i in input().split()] ans=[1 for i in range(N)] for i in range(N-2): if K[i]>K[i+1]: ans[i]=K[i] else: ans[i+1]=K[i] if K[-2]<K[-1]: ans[-1]=K[-1] ansS="" for i in range(N): ansS+=str(ans[i]) ansS+=" " print(ansS[0:-1])
Submission Info
Submission Time | |
---|---|
Task | B - 積み鉛筆 |
User | toma25 |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 277 Byte |
Status | WA |
Exec Time | 137 ms |
Memory | 13844 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | 18 ms | 3064 KB |
sample2.txt | AC | 19 ms | 3064 KB |
sample3.txt | AC | 18 ms | 3064 KB |
subtask0_0.txt | AC | 123 ms | 12756 KB |
subtask0_1.txt | AC | 130 ms | 13512 KB |
subtask0_10.txt | AC | 119 ms | 12128 KB |
subtask0_11.txt | AC | 128 ms | 12760 KB |
subtask0_12.txt | AC | 117 ms | 12532 KB |
subtask0_13.txt | AC | 126 ms | 12664 KB |
subtask0_14.txt | AC | 137 ms | 13844 KB |
subtask0_2.txt | AC | 110 ms | 11292 KB |
subtask0_3.txt | WA | 117 ms | 12052 KB |
subtask0_4.txt | AC | 130 ms | 13676 KB |
subtask0_5.txt | WA | 116 ms | 12140 KB |
subtask0_6.txt | AC | 121 ms | 12052 KB |
subtask0_7.txt | AC | 110 ms | 11148 KB |
subtask0_8.txt | AC | 128 ms | 12788 KB |
subtask0_9.txt | AC | 132 ms | 13768 KB |