Submission #16,426

2025-04-29 17:58:41

pypy3

Accepted 80/80

79ms

33628 KiB

# UUID: da01a12a-d5d2-4dca-9431-a53c1b4ae5b9
n =int(input())
x = [int(x) for x in input().split()]

v =[]
for i in range(n+1):
    v.append(0)

Y = 0
db = 0
most= 0
ok =0
b =0
while n > Y:
    
    #print(x[Y],Y)
   
    v[x[Y-1]]+=1
    Y+=x[Y]
    db +=1   
     
print(db)
print(v.index(max(v)))

	Sum	Test	Verdict		Time	Memory
base	80/80
		1	Accepted	0/0	43ms	19408 KiB
		2	Accepted	0/0	43ms	19332 KiB
		3	Accepted	4/4	39ms	19268 KiB
		4	Accepted	4/4	39ms	19320 KiB
		5	Accepted	4/4	39ms	19444 KiB
		6	Accepted	4/4	39ms	19432 KiB
		7	Accepted	4/4	46ms	19572 KiB
		8	Accepted	4/4	45ms	19544 KiB
		9	Accepted	4/4	41ms	19948 KiB
		10	Accepted	4/4	54ms	21376 KiB
		11	Accepted	4/4	57ms	21480 KiB
		12	Accepted	4/4	50ms	21628 KiB
		13	Accepted	4/4	57ms	21592 KiB
		14	Accepted	4/4	54ms	21436 KiB
		15	Accepted	4/4	48ms	21684 KiB
		16	Accepted	4/4	52ms	23272 KiB
		17	Accepted	4/4	56ms	25012 KiB
		18	Accepted	4/4	68ms	33440 KiB
		19	Accepted	4/4	79ms	33460 KiB
		20	Accepted	4/4	76ms	33312 KiB
		21	Accepted	4/4	68ms	33628 KiB
		22	Accepted	4/4	78ms	33156 KiB