Submission #1355772


Source Code Expand

n=int(raw_input())
k=map(int,raw_input().split())
ans=[-1]*n
for i in xrange(n-2):
    if k[i]>k[i+1]:
        ans[i]=k[i]
        ans[i+1]=k[i+1]
    elif k[i]<k[i+1]:
        ans[i+2]=k[i+1]
        ans[i+1]=k[i]
        if ans[i]==-1:
            ans[i]=k[i]
    else:
        ans[i+1]=k[i]
if ans[n-1]==-1:
    ans[n-1]=k[n-2]
print " ".join(map(str,ans))

Submission Info

Submission Time
Task B - 積み鉛筆
User roto_37
Language Python (2.7.6)
Score 80
Code Size 375 Byte
Status AC
Exec Time 107 ms
Memory 12716 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 11 ms 2692 KB
sample2.txt AC 11 ms 2692 KB
sample3.txt AC 11 ms 2692 KB
subtask0_0.txt AC 97 ms 11768 KB
subtask0_1.txt AC 107 ms 12396 KB
subtask0_10.txt AC 98 ms 11520 KB
subtask0_11.txt AC 97 ms 12204 KB
subtask0_12.txt AC 88 ms 11548 KB
subtask0_13.txt AC 105 ms 12092 KB
subtask0_14.txt AC 100 ms 12716 KB
subtask0_2.txt AC 89 ms 10840 KB
subtask0_3.txt AC 85 ms 11124 KB
subtask0_4.txt AC 105 ms 12232 KB
subtask0_5.txt AC 85 ms 10960 KB
subtask0_6.txt AC 93 ms 11144 KB
subtask0_7.txt AC 90 ms 10556 KB
subtask0_8.txt AC 97 ms 12244 KB
subtask0_9.txt AC 100 ms 12708 KB