Submission #23139435

Source Code Expand

import collections

N = int(input())
G = collections.defaultdict(list)

for _ in range(N-1):
    a,b=map(int,input().split())
    a-=1; b-=1
    G[a].append(b)
    G[b].append(a)


def bfs(que: collections.deque):
    vmem = collections.defaultdict(int)
    vd = set()
    while que:
        i,depth = que.popleft()
        if i in vd:
            continue
        vd.add(i)
        vmem[i] = depth
        for j in G[i]:
            que.append((j, depth+1))
    return vmem

que = collections.deque([(0, 0)])
vmem = bfs(que)
v, k = max([(v,k) for k,v in vmem.items()])
que = collections.deque([(k, 0)])
vmem = bfs(que)
print(max(vmem.values()) + 1)

Submission Info

Submission Time
Task 003 - Longest Circular Road（★4）
User lightning
Language PyPy3 (7.3.0)
Score 4
Code Size 679 Byte
Status AC
Exec Time 400 ms
Memory 141564 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 4 / 4
Status
AC × 4
AC × 26
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt
All sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt
Case Name Status Exec Time Memory
sample_01.txt AC 213 ms 64856 KiB
sample_02.txt AC 56 ms 65040 KiB
sample_03.txt AC 58 ms 65092 KiB
sample_04.txt AC 59 ms 65284 KiB
subtask_1_01.txt AC 63 ms 67272 KiB
subtask_1_02.txt AC 61 ms 67152 KiB
subtask_1_03.txt AC 59 ms 67156 KiB
subtask_1_04.txt AC 368 ms 124828 KiB
subtask_1_05.txt AC 314 ms 114612 KiB
subtask_1_06.txt AC 328 ms 119996 KiB
subtask_1_07.txt AC 67 ms 67768 KiB
subtask_1_08.txt AC 135 ms 73060 KiB
subtask_1_09.txt AC 127 ms 71600 KiB
subtask_1_10.txt AC 79 ms 68036 KiB
subtask_1_11.txt AC 56 ms 64964 KiB
subtask_1_12.txt AC 363 ms 121568 KiB
subtask_1_13.txt AC 184 ms 84432 KiB
subtask_1_14.txt AC 56 ms 65008 KiB
subtask_1_15.txt AC 134 ms 73172 KiB
subtask_1_16.txt AC 392 ms 127524 KiB
subtask_1_17.txt AC 399 ms 131868 KiB
subtask_1_18.txt AC 394 ms 126388 KiB
subtask_1_19.txt AC 400 ms 131712 KiB
subtask_1_20.txt AC 400 ms 129976 KiB
subtask_1_21.txt AC 293 ms 131452 KiB
subtask_1_22.txt AC 307 ms 141564 KiB