Submission #1537519
Source Code Expand
N=int(input()) K_n=[int(i) for i in input().split()] a=[K_n[0]] for i in range(len(K_n)-1): a.append(min(K_n[i],K_n[i+1])) for i in range(len(a)): print(K_n[i],end=' ') print(K_n[N-2])
Submission Info
Submission Time | |
---|---|
Task | B - 積み鉛筆 |
User | ngotarou |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 203 Byte |
Status | WA |
Exec Time | 197 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 | WA | 16 ms | 3060 KB |
sample2.txt | WA | 16 ms | 2940 KB |
sample3.txt | WA | 16 ms | 3060 KB |
subtask0_0.txt | WA | 180 ms | 12824 KB |
subtask0_1.txt | WA | 189 ms | 13636 KB |
subtask0_10.txt | WA | 167 ms | 12120 KB |
subtask0_11.txt | WA | 189 ms | 12768 KB |
subtask0_12.txt | WA | 166 ms | 12468 KB |
subtask0_13.txt | WA | 178 ms | 12672 KB |
subtask0_14.txt | WA | 197 ms | 13844 KB |
subtask0_2.txt | WA | 158 ms | 11292 KB |
subtask0_3.txt | WA | 160 ms | 12052 KB |
subtask0_4.txt | WA | 189 ms | 12912 KB |
subtask0_5.txt | WA | 179 ms | 12140 KB |
subtask0_6.txt | WA | 168 ms | 12244 KB |
subtask0_7.txt | WA | 161 ms | 11660 KB |
subtask0_8.txt | WA | 195 ms | 12660 KB |
subtask0_9.txt | WA | 194 ms | 13644 KB |