Submission #1044818

Source Code Expand

n = input()
K = map(int, raw_input().split())
ans = [0]*n
for i in xrange(n-2):
    ans[i+1] = min(K[i], K[i+1])
ans[0] = K[0]
ans[-1] = K[-1]
print " ".join(map(str, ans))

Submission Info

Submission Time
Task B - 積み鉛筆
User yaketake08
Language Python (2.7.3)
Score 80
Code Size 179 Byte
Status AC
Exec Time 152 ms
Memory 13496 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 80 / 80
Status
AC × 3
AC × 15
Set Name Test Cases
Sample sample1.txt, sample2.txt, sample3.txt
All 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 38 ms 3252 KB
sample2.txt AC 36 ms 3324 KB
sample3.txt AC 37 ms 3260 KB
subtask0_0.txt AC 141 ms 12552 KB
subtask0_1.txt AC 147 ms 13112 KB
subtask0_10.txt AC 135 ms 12348 KB
subtask0_11.txt AC 146 ms 12960 KB
subtask0_12.txt AC 137 ms 12252 KB
subtask0_13.txt AC 142 ms 12788 KB
subtask0_14.txt AC 149 ms 13496 KB
subtask0_2.txt AC 128 ms 11420 KB
subtask0_3.txt AC 134 ms 11840 KB
subtask0_4.txt AC 144 ms 13060 KB
subtask0_5.txt AC 130 ms 11668 KB
subtask0_6.txt AC 133 ms 11844 KB
subtask0_7.txt AC 128 ms 11388 KB
subtask0_8.txt AC 144 ms 12936 KB
subtask0_9.txt AC 152 ms 13404 KB