PTA L2-031深入虎穴 python

from collections import deque
n = int(input())
fa = [i for i in range(n+1)]
son = [[] for _ in range(n+1)]
for i in range(1,n+1):
    temp = input().split()
    if temp[0] == '0':
        continue
    nums = map(int,temp[1:])
    for j in nums:
        fa[j] = i
        son[i].append(j)
for i in range(1,n+1):
    if fa[i] == i:
        root = i
        break
q = deque()
q.append(root)
while q:
    l = len(q)
    for i in range(l):
        node = q.popleft()
        for j in range(len(son[node])):
            q.append(son[node][j])
print(node)