240872026-02-04 08:38:37vyrallLegtávolabbi leszármazottpython3Time limit exceeded 20/50402ms24512 KiB
from collections import deque

n = int(input())
fw_ind = [[] for _ in range(n)]
bw_ind = [-1] * n
for _ in range(n-1):
    a, f = map(int, input().split())
    bw_ind[f-1] = a-1
    fw_ind[a-1].append(f-1)

dist = [1] * n
q = deque(i for i in range(n) if bw_ind[i] == -1)
while q:
    node = q.popleft()
    for i in fw_ind[node]:
        dist[i] = dist[node] + 1
        q.append(i)

mx, mx_ind = max((dist[i], i+1) for i in range(n))

print(mx_ind)
SubtaskSumTestVerdictTimeMemory
base20/50
1Accepted0/018ms3568 KiB
2Time limit exceeded0/0354ms18364 KiB
3Accepted1/118ms3380 KiB
4Accepted3/318ms3376 KiB
5Accepted3/319ms3380 KiB
6Accepted1/119ms3420 KiB
7Accepted1/119ms3580 KiB
8Accepted1/121ms3628 KiB
9Time limit exceeded0/2402ms20028 KiB
10Time limit exceeded0/3402ms20020 KiB
11Accepted3/318ms3404 KiB
12Time limit exceeded0/4379ms23488 KiB
13Time limit exceeded0/4386ms23488 KiB
14Accepted3/354ms5056 KiB
15Time limit exceeded0/3379ms22340 KiB
16Time limit exceeded0/3347ms21184 KiB
17Time limit exceeded0/3402ms22396 KiB
18Accepted4/4284ms17856 KiB
19Time limit exceeded0/4375ms20416 KiB
20Time limit exceeded0/4388ms24512 KiB