← Back to List

11558번: The Game of Death ↗

Solutions

Python 3
777 B | 777 chars
import sys
from math import sqrt, pi, sin, factorial, ceil, floor
from datetime import datetime, timedelta
# sys.setrecursionlimit(10**7)

BLANK = " "

# inp = input
inp = lambda : sys.stdin.readline().rstrip()
mii = lambda x = BLANK : [*map(int,inp().split(x))]
mfi = lambda x = BLANK : [*map(float,inp().split(x))]
ii = lambda : int(inp())
fi = lambda : float(inp())
p = print
def gcd(a, b): return gcd(b, a % b) if b > 0 else a
def lcm(a, b): return a * b // gcd(a, b)


def solve():
	n = ii()

	l = [ii() - 1 for _ in range(n)]

	chk = [False] * n
	d = [0] * n

	here = 0
	cnt = 0
	while chk[here] == False:
		chk[here] = True
		d[here] = cnt

		cnt += 1
		here = l[here]

	p(d[n - 1])


if __name__ == "__main__":
  tc = ii()

  for t in range(1, tc+1):
    ret = solve()