Submission #1481025
Source Code Expand
N = int(input()) K = list(map(int, input().split())) ans = [K[0]] for i in range(len(K)-1): ans.append(min(K[i], K[i+1])) ans.append(K[-1]) print(*ans)
Submission Info
Submission Time | |
---|---|
Task | B - 積み鉛筆 |
User | TakuyaNakazato02 |
Language | Python (3.4.3) |
Score | 80 |
Code Size | 173 Byte |
Status | AC |
Exec Time | 139 ms |
Memory | 14676 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 | 17 ms | 2940 KB |
sample2.txt | AC | 17 ms | 3060 KB |
sample3.txt | AC | 17 ms | 3060 KB |
subtask0_0.txt | AC | 105 ms | 12760 KB |
subtask0_1.txt | AC | 111 ms | 13764 KB |
subtask0_10.txt | AC | 105 ms | 12640 KB |
subtask0_11.txt | AC | 110 ms | 12768 KB |
subtask0_12.txt | AC | 105 ms | 12472 KB |
subtask0_13.txt | AC | 108 ms | 12664 KB |
subtask0_14.txt | AC | 122 ms | 14676 KB |
subtask0_2.txt | AC | 104 ms | 11804 KB |
subtask0_3.txt | AC | 105 ms | 12056 KB |
subtask0_4.txt | AC | 113 ms | 12912 KB |
subtask0_5.txt | AC | 99 ms | 12008 KB |
subtask0_6.txt | AC | 101 ms | 12244 KB |
subtask0_7.txt | AC | 96 ms | 11788 KB |
subtask0_8.txt | AC | 113 ms | 12788 KB |
subtask0_9.txt | AC | 139 ms | 13644 KB |