Submission #615868

Source Code Expand

N = input()
K = map(int, raw_input().split())
print K[0],
for i in range(N-2):
    print min(K[i], K[i+1]),
print K[-1]

Submission Info

Submission Time
Task B - 積み鉛筆
User kusano
Language Python (2.7.3)
Score 80
Code Size 126 Byte
Status AC
Exec Time 252 ms
Memory 12032 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 62 ms 3308 KB
sample2.txt AC 56 ms 3252 KB
sample3.txt AC 60 ms 3244 KB
subtask0_0.txt AC 232 ms 10948 KB
subtask0_1.txt AC 241 ms 11880 KB
subtask0_10.txt AC 226 ms 11036 KB
subtask0_11.txt AC 239 ms 11552 KB
subtask0_12.txt AC 229 ms 10728 KB
subtask0_13.txt AC 231 ms 11524 KB
subtask0_14.txt AC 245 ms 12032 KB
subtask0_2.txt AC 206 ms 10248 KB
subtask0_3.txt AC 223 ms 10372 KB
subtask0_4.txt AC 238 ms 11768 KB
subtask0_5.txt AC 207 ms 10492 KB
subtask0_6.txt AC 216 ms 10372 KB
subtask0_7.txt AC 214 ms 10204 KB
subtask0_8.txt AC 252 ms 11556 KB
subtask0_9.txt AC 247 ms 11760 KB