Submission #9,832

2024-03-09 20:02:47

python3

Wrong answer 65/100

146ms

36128 KiB

n = int(input())
mezok = input().strip().split()
mezok = list(map(int, mezok))
o = []
for i in range(1,7):
    current_field = 0
    moves = 0
    while current_field<n:
        current_field += i
        if current_field < n:
            current_field += mezok[current_field]
        moves += 1
    
    o.append(moves)
o = map(str, o)
o1 = ""
for k in o:
    o1 += k + " " 
print(o1)

	Sum	Test	Verdict	Time	Memory
subtask1	0/0
		1	Accepted	18ms	11176 KiB
		2	Accepted	17ms	11392 KiB
subtask2	25/25
		3	Accepted	17ms	11332 KiB
		4	Accepted	17ms	11656 KiB
		5	Accepted	19ms	11924 KiB
		6	Accepted	32ms	12532 KiB
		7	Accepted	146ms	16184 KiB
subtask3	40/40
		8	Accepted	18ms	12268 KiB
		9	Accepted	18ms	12888 KiB
		10	Accepted	20ms	14316 KiB
		11	Accepted	23ms	15824 KiB
		12	Accepted	28ms	19508 KiB
		13	Accepted	35ms	23464 KiB
		14	Accepted	41ms	27236 KiB
		15	Accepted	46ms	28764 KiB
subtask4	0/35
		16	Accepted	37ms	13572 KiB
		17	Accepted	23ms	16224 KiB
		18	Wrong answer	27ms	19812 KiB
		19	Wrong answer	28ms	21916 KiB
		20	Accepted	32ms	20812 KiB
		21	Wrong answer	37ms	27224 KiB
		22	Wrong answer	39ms	29704 KiB
		23	Wrong answer	41ms	32424 KiB
		24	Accepted	43ms	27684 KiB
		25	Wrong answer	46ms	36128 KiB