Submission #1966996
Source Code Expand
import numpy as np N=int(input()) K_lst=([int(_) for _ in input().split()]) ans_lst=[K_lst[0]] for i in range(N-2): ans_lst.append(min(K_lst[i], K_lst[i+1])) ans_lst.append(K_lst[-1]) print(ans_lst)
Submission Info
Submission Time | |
---|---|
Task | B - 積み鉛筆 |
User | m2ku |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 213 Byte |
Status | WA |
Exec Time | 269 ms |
Memory | 23000 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 | WA | 269 ms | 18600 KB |
sample2.txt | WA | 148 ms | 12404 KB |
sample3.txt | WA | 148 ms | 12388 KB |
subtask0_0.txt | WA | 223 ms | 21664 KB |
subtask0_1.txt | WA | 218 ms | 22088 KB |
subtask0_10.txt | WA | 211 ms | 21720 KB |
subtask0_11.txt | WA | 217 ms | 22368 KB |
subtask0_12.txt | WA | 212 ms | 21588 KB |
subtask0_13.txt | WA | 214 ms | 22480 KB |
subtask0_14.txt | WA | 226 ms | 23000 KB |
subtask0_2.txt | WA | 205 ms | 20204 KB |
subtask0_3.txt | WA | 209 ms | 21200 KB |
subtask0_4.txt | WA | 216 ms | 22588 KB |
subtask0_5.txt | WA | 205 ms | 20520 KB |
subtask0_6.txt | WA | 209 ms | 21012 KB |
subtask0_7.txt | WA | 205 ms | 20736 KB |
subtask0_8.txt | WA | 217 ms | 22480 KB |
subtask0_9.txt | WA | 219 ms | 22736 KB |