Submission #1150218

Source Code Expand

N=int(input())
K=[int(i) for i in input().split()]
ans=[1 for i in range(N)]

for i in range(N-2):
	if K[i]>K[i+1]:
		ans[i]=K[i]
	elif K[i]==K[i+1]:
		ans[i]=K[i+1]
	else:
		ans[i+1]=K[i]

ansS=""
for i in range(N):
	ansS+=str(ans[i])
	ansS+=" "
print(ansS[0:-1])

Submission Info

Submission Time
Task B - 積み鉛筆
User toma25
Language Python (3.4.3)
Score 0
Code Size 280 Byte
Status WA
Exec Time 146 ms
Memory 13844 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 80
Status
WA × 3
WA × 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 WA 18 ms 3064 KB
sample2.txt WA 19 ms 3064 KB
sample3.txt WA 19 ms 3060 KB
subtask0_0.txt WA 129 ms 12760 KB
subtask0_1.txt WA 145 ms 13636 KB
subtask0_10.txt WA 136 ms 12120 KB
subtask0_11.txt WA 138 ms 12768 KB
subtask0_12.txt WA 130 ms 12472 KB
subtask0_13.txt WA 142 ms 13440 KB
subtask0_14.txt WA 143 ms 13844 KB
subtask0_2.txt WA 121 ms 11292 KB
subtask0_3.txt WA 128 ms 12056 KB
subtask0_4.txt WA 146 ms 12912 KB
subtask0_5.txt WA 122 ms 12140 KB
subtask0_6.txt WA 123 ms 12052 KB
subtask0_7.txt WA 125 ms 11148 KB
subtask0_8.txt WA 137 ms 12788 KB
subtask0_9.txt WA 144 ms 13772 KB