Submission #3652378
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(" ".join(map(str, ans)))
Submission Info
Submission Time | |
---|---|
Task | B - 積み鉛筆 |
User | odanny |
Language | Python (3.4.3) |
Score | 80 |
Code Size | 184 Byte |
Status | AC |
Exec Time | 102 ms |
Memory | 15432 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 | 2940 KB |
sample3.txt | AC | 17 ms | 2940 KB |
subtask0_0.txt | AC | 89 ms | 14296 KB |
subtask0_1.txt | AC | 96 ms | 14492 KB |
subtask0_10.txt | AC | 85 ms | 13380 KB |
subtask0_11.txt | AC | 102 ms | 14172 KB |
subtask0_12.txt | AC | 86 ms | 13880 KB |
subtask0_13.txt | AC | 88 ms | 13952 KB |
subtask0_14.txt | AC | 93 ms | 14680 KB |
subtask0_2.txt | AC | 80 ms | 12488 KB |
subtask0_3.txt | AC | 83 ms | 13464 KB |
subtask0_4.txt | AC | 99 ms | 14192 KB |
subtask0_5.txt | AC | 81 ms | 12648 KB |
subtask0_6.txt | AC | 85 ms | 13652 KB |
subtask0_7.txt | AC | 80 ms | 12472 KB |
subtask0_8.txt | AC | 90 ms | 14068 KB |
subtask0_9.txt | AC | 100 ms | 15432 KB |