Submission #9,831

2024-03-09 19:59:47

python3

Wrong answer 0/100

153ms

36016 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)

print(o)

	Sum	Test	Verdict	Time	Memory
subtask1	0/0
		1	Wrong answer	18ms	11012 KiB
		2	Wrong answer	17ms	11360 KiB
subtask2	0/25
		3	Wrong answer	17ms	11544 KiB
		4	Wrong answer	17ms	11552 KiB
		5	Wrong answer	19ms	11940 KiB
		6	Wrong answer	30ms	12224 KiB
		7	Wrong answer	153ms	15668 KiB
subtask3	0/40
		8	Wrong answer	18ms	12336 KiB
		9	Wrong answer	18ms	12944 KiB
		10	Wrong answer	20ms	14408 KiB
		11	Wrong answer	23ms	16324 KiB
		12	Wrong answer	28ms	19228 KiB
		13	Wrong answer	37ms	23200 KiB
		14	Wrong answer	43ms	27348 KiB
		15	Wrong answer	45ms	28972 KiB
subtask4	0/35
		16	Wrong answer	39ms	14024 KiB
		17	Wrong answer	23ms	16572 KiB
		18	Wrong answer	26ms	20164 KiB
		19	Wrong answer	28ms	22216 KiB
		20	Wrong answer	30ms	21356 KiB
		21	Wrong answer	37ms	27448 KiB
		22	Wrong answer	37ms	30036 KiB
		23	Wrong answer	39ms	32656 KiB
		24	Wrong answer	43ms	27720 KiB
		25	Wrong answer	50ms	36016 KiB