195342025-12-13 18:31:13birozsLegtávolabbi leszármazottpython3Time limit exceeded 20/50388ms26316 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
base20/50
1Accepted0/016ms3124 KiB
2Time limit exceeded0/0314ms16164 KiB
3Accepted1/116ms3376 KiB
4Accepted3/317ms3120 KiB
5Accepted3/316ms3324 KiB
6Accepted1/116ms3124 KiB
7Accepted1/116ms3128 KiB
8Accepted1/119ms3040 KiB
9Time limit exceeded0/2370ms17696 KiB
10Time limit exceeded0/3344ms17824 KiB
11Accepted3/317ms3124 KiB
12Time limit exceeded0/4388ms20512 KiB
13Time limit exceeded0/4370ms20512 KiB
14Accepted3/346ms4392 KiB
15Time limit exceeded0/3377ms21536 KiB
16Time limit exceeded0/3338ms19780 KiB
17Time limit exceeded0/3381ms19744 KiB
18Accepted4/4263ms17524 KiB
19Time limit exceeded0/4328ms18720 KiB
20Time limit exceeded0/4388ms26316 KiB