195332025-12-13 17:41:27birozsLegtávolabbi leszármazottpypy3Time limit exceeded 16/50402ms25064 KiB
N = int(input())
Fa = {}
Fiu = []
for _ in range(N-1):
    A,B = map(int,input().split())
    if A not in Fa:
        Fa[A] = [B]
    else:
        Fa[A].append(B)
    if B not in Fiu:
        Fiu.append(B)
for i in range(1,N+1):
    if i not in Fiu:
        Os = i
        break
Tav = [0] * (N+1)
sor = [Os]
hossz = 0
while sor:
    akt = sor.pop()
    hossz = Tav[akt] + 1
    if akt in Fa:
        for k in Fa[akt]:
            sor.append(k)
            Tav[k] = hossz
print(Tav.index(max(Tav)))
SubtaskSumTestVerdictTimeMemory
base16/50
1Accepted0/039ms19548 KiB
2Time limit exceeded0/0384ms24276 KiB
3Accepted1/139ms19672 KiB
4Accepted3/339ms19460 KiB
5Accepted3/339ms19680 KiB
6Accepted1/143ms19696 KiB
7Accepted1/146ms21176 KiB
8Accepted1/161ms21476 KiB
9Time limit exceeded0/2402ms23780 KiB
10Time limit exceeded0/3402ms23856 KiB
11Accepted3/348ms21228 KiB
12Time limit exceeded0/4386ms24296 KiB
13Time limit exceeded0/4379ms24292 KiB
14Accepted3/3197ms22496 KiB
15Time limit exceeded0/3388ms24548 KiB
16Time limit exceeded0/3388ms24804 KiB
17Time limit exceeded0/3391ms24296 KiB
18Time limit exceeded0/4384ms25064 KiB
19Time limit exceeded0/4389ms24552 KiB
20Time limit exceeded0/4386ms25064 KiB