結果

問題 No.277 根掘り葉掘り
ユーザー H3PO4H3PO4
提出日時 2020-06-09 09:03:27
言語 Python3
(3.13.1 + numpy 2.2.1 + scipy 1.14.1)
結果
AC  
実行時間 977 ms / 3,000 ms
コード長 884 bytes
コンパイル時間 261 ms
コンパイル使用メモリ 12,672 KB
実行使用メモリ 36,404 KB
最終ジャッジ日時 2024-12-30 18:40:55
合計ジャッジ時間 13,609 ms
ジャッジサーバーID
(参考情報)
judge2 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 18
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

from collections import deque
N = int(input())
int1 = lambda x: int(x) - 1
T = [[] for _ in range(N)]
for _ in range(N - 1):
a, b = map(int1, input().split())
T[a].append(b)
T[b].append(a)
# (dfs)
d = deque([0])
root_distance = [None] * N
root_distance[0] = 0
while d:
v = d.pop()
for x in T[v]:
if root_distance[x] is None:
root_distance[x] = root_distance[v] + 1
d.append(x)
# print(root_distance)
# (bfs)
leaves = {i for i in range(N) if len(T[i]) == 1}
leaf_distance = [0 if i in leaves else None for i in range(N)]
d = deque(leaves)
while d:
v = d.popleft()
for x in T[v]:
if leaf_distance[x] is None:
leaf_distance[x] = leaf_distance[v] + 1
d.append(x)
# print(leaf_distance)
for i in range(N):
print(min(root_distance[i], leaf_distance[i]))
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0