Submission #1403858

Source Code Expand

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

Submission Info

Submission Time
Task B - 積み鉛筆
User niyarin
Language Python (2.7.6)
Score 80
Code Size 132 Byte
Status AC
Exec Time 100 ms
Memory 11232 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 80 / 80
Status
AC × 3
AC × 18
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 10 ms 2568 KB
sample2.txt AC 10 ms 2568 KB
sample3.txt AC 10 ms 2568 KB
subtask0_0.txt AC 87 ms 10276 KB
subtask0_1.txt AC 100 ms 11080 KB
subtask0_10.txt AC 85 ms 10364 KB
subtask0_11.txt AC 93 ms 10876 KB
subtask0_12.txt AC 99 ms 10048 KB
subtask0_13.txt AC 88 ms 10844 KB
subtask0_14.txt AC 95 ms 11232 KB
subtask0_2.txt AC 86 ms 9572 KB
subtask0_3.txt AC 80 ms 9696 KB
subtask0_4.txt AC 92 ms 10964 KB
subtask0_5.txt AC 80 ms 9812 KB
subtask0_6.txt AC 80 ms 9696 KB
subtask0_7.txt AC 76 ms 9524 KB
subtask0_8.txt AC 89 ms 10880 KB
subtask0_9.txt AC 93 ms 10956 KB