PAT(Advanced Level) Practice（with python）——1094 The Largest Generation

Code

N,M = map(int,input().split())
child = [ [] for i in range(N+1)]
numer_level = [0 for i in range(N+1)]

def dfs(temp=1,level=1):
    numer_level[level] += 1
    for c in child[temp]:
        dfs(c,level+1)


for m in range(M):
    i,k,*j = map(int,input().split())
    child[i]+=j

dfs(1,1)
print(max(numer_level),numer_level.index(max(numer_level)))