結果

問題 No.277 根掘り葉掘り
ユーザー 双六双六
提出日時 2020-08-04 02:24:49
言語 PyPy3
(7.3.8)
結果
AC  
実行時間 564 ms / 3,000 ms
コード長 1,753 bytes
コンパイル時間 282 ms
使用メモリ 187,824 KB
最終ジャッジ日時 2023-02-26 03:57:23
合計ジャッジ時間 9,444 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge13
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
testcase_00 AC 92 ms
76,644 KB
testcase_01 AC 95 ms
76,504 KB
testcase_02 AC 98 ms
76,588 KB
testcase_03 AC 97 ms
76,536 KB
testcase_04 AC 95 ms
76,484 KB
testcase_05 AC 96 ms
76,504 KB
testcase_06 AC 97 ms
76,600 KB
testcase_07 AC 94 ms
76,700 KB
testcase_08 AC 93 ms
76,548 KB
testcase_09 AC 551 ms
187,824 KB
testcase_10 AC 380 ms
108,136 KB
testcase_11 AC 379 ms
108,988 KB
testcase_12 AC 522 ms
150,116 KB
testcase_13 AC 442 ms
106,184 KB
testcase_14 AC 477 ms
176,876 KB
testcase_15 AC 564 ms
143,212 KB
testcase_16 AC 438 ms
139,204 KB
testcase_17 AC 474 ms
163,740 KB
testcase_18 AC 432 ms
150,384 KB
testcase_19 AC 442 ms
133,120 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys; input = sys.stdin.buffer.readline
sys.setrecursionlimit(10**7)
from collections import defaultdict
from collections import deque
con = 10 ** 9 + 7; INF = float("inf")

def getlist():
	return list(map(int, input().split()))

class Graph(object):
	def __init__(self):
		self.graph = defaultdict(list)

	def __len__(self):
		return len(self.graph)

	def add_edge(self, a, b):
		self.graph[a].append(b)

class BFS(object):
	def __init__(self, graph, s, leafDist, N):
		self.g = graph.graph
		self.Q = deque(); self.Q.append(s)
		self.dist = [INF] * N; self.dist[s] = 0
		while self.Q:
			v = self.Q.popleft()
			jud = 0
			for i in self.g[v]:
				if self.dist[i] == INF:
					self.dist[i] = self.dist[v] + 1
					self.Q.append(i)
					jud = 1
			if jud == 0:
				leafDist[v] = 0

class BFS2(object):
	def __init__(self, graph, s, leafDist, N):
		self.g = graph.graph
		self.Q = deque(); self.Q.append(s)
		self.dist = [INF] * N; self.dist[s] = 0
		while self.Q:
			v = self.Q.popleft()
			for i in self.g[v]:
				if self.dist[i] == INF:
					self.dist[i] = self.dist[v] + 1
					leafDist[i] = min(leafDist[i], leafDist[v] + 1)
					self.Q.append(i)

def DFS(G, leafDist, visit, node):
	for i in G.graph[node]:
		if visit[i] != 1:
			visit[i] = 1
			DFS(G, leafDist, visit, i)
			leafDist[node] = min(leafDist[i] + 1, leafDist[node])

#処理内容
def main():
	N = int(input())
	G = Graph()
	for i in range(N - 1):
		a, b = getlist()
		a -= 1; b -= 1
		G.add_edge(a, b)
		G.add_edge(b, a)

	leafDist = [INF] * N
	BF = BFS(G, 0, leafDist, N)

	visit = [0] * N
	visit[0] = 1
	DFS(G, leafDist, visit, 0)
	# print(leafDist)

	BF2 = BFS2(G, 0, leafDist, N)
	for i in range(N):
		print(min(BF.dist[i], leafDist[i]))

if __name__ == '__main__':
	main()
0