Submission #18,752

2025-11-04 11:46:51

python3

Accepted 100/100

138ms

14968 KiB

N = int(input())
J = list(map(int, input().split()))

for dieRoll in range(1, 7):
    currentPos = 0
    rollCount = 0
    hasPrinted = 0
    while (currentPos < N):
        while(currentPos < N and J[currentPos] != 0):
            currentPos+=J[currentPos]
        if (currentPos >= N):
            hasPrinted = 1
            print(rollCount, end=" ")
            continue
        currentPos+= dieRoll
        rollCount += 1
    if not hasPrinted:
        print(rollCount, end=" ")

	Sum	Test	Verdict	Time	Memory
subtask1	0/0
		1	Accepted	16ms	3124 KiB
		2	Accepted	16ms	2868 KiB
subtask2	25/25
		3	Accepted	16ms	3124 KiB
		4	Accepted	16ms	3136 KiB
		5	Accepted	17ms	3120 KiB
		6	Accepted	28ms	3116 KiB
		7	Accepted	138ms	5132 KiB
subtask3	40/40
		8	Accepted	17ms	3304 KiB
		9	Accepted	17ms	3136 KiB
		10	Accepted	18ms	3740 KiB
		11	Accepted	21ms	4528 KiB
		12	Accepted	27ms	6028 KiB
		13	Accepted	37ms	8412 KiB
		14	Accepted	41ms	9852 KiB
		15	Accepted	43ms	11300 KiB
subtask4	35/35
		16	Accepted	32ms	3380 KiB
		17	Accepted	20ms	4592 KiB
		18	Accepted	25ms	6760 KiB
		19	Accepted	28ms	7548 KiB
		20	Accepted	30ms	6828 KiB
		21	Accepted	32ms	10164 KiB
		22	Accepted	39ms	11532 KiB
		23	Accepted	39ms	12856 KiB
		24	Accepted	41ms	9876 KiB
		25	Accepted	45ms	14968 KiB