195352025-12-13 18:31:49birozsLegtávolabbi leszármazottpypy3Runtime error 16/50173ms32000 KiB
N = int(input())
Fa = {}
Fiu = [0] * (N+1)
for _ in range(N-1):
    A,B = map(int,input().split())
    if A not in Fa:
        Fa[A] = [B]
    else:
        Fa[A].append(B)
    Fiu[B] = 1
Os = Fiu[1:].index(0) + 1
Tav = [0] * (N+1)
sor = [Os]
hossz = 0
maxhossz = 0
while sor:
    akt = sor.pop()
    hossz = Tav[akt] + 1
    if hossz > maxhossz:
        maxhossz = hossz
        maxfiu = akt
    if akt in Fa:
        for k in Fa[akt]:
            sor.append(k)
            Tav[k] = hossz
print(maxfiu)
SubtaskSumTestVerdictTimeMemory
base16/50
1Accepted0/045ms19464 KiB
2Runtime error0/0164ms32000 KiB
3Accepted1/145ms19580 KiB
4Accepted3/345ms19616 KiB
5Accepted3/345ms19752 KiB
6Accepted1/146ms19636 KiB
7Accepted1/154ms21228 KiB
8Accepted1/170ms21660 KiB
9Runtime error0/2173ms32000 KiB
10Runtime error0/3170ms32000 KiB
11Accepted3/350ms21224 KiB
12Runtime error0/4142ms32000 KiB
13Runtime error0/4141ms32000 KiB
14Accepted3/397ms22408 KiB
15Runtime error0/3145ms32000 KiB
16Runtime error0/3142ms32000 KiB
17Runtime error0/3145ms32000 KiB
18Runtime error0/4150ms32000 KiB
19Runtime error0/4138ms32000 KiB
20Runtime error0/4136ms32000 KiB