結果
問題 | No.277 根掘り葉掘り |
ユーザー |
![]() |
提出日時 | 2020-08-04 02:24:49 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 483 ms / 3,000 ms |
コード長 | 1,753 bytes |
コンパイル時間 | 215 ms |
コンパイル使用メモリ | 82,176 KB |
実行使用メモリ | 184,572 KB |
最終ジャッジ日時 | 2024-09-13 20:33:27 |
合計ジャッジ時間 | 6,999 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 18 |
ソースコード
import sys; input = sys.stdin.buffer.readlinesys.setrecursionlimit(10**7)from collections import defaultdictfrom collections import dequecon = 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.graphself.Q = deque(); self.Q.append(s)self.dist = [INF] * N; self.dist[s] = 0while self.Q:v = self.Q.popleft()jud = 0for i in self.g[v]:if self.dist[i] == INF:self.dist[i] = self.dist[v] + 1self.Q.append(i)jud = 1if jud == 0:leafDist[v] = 0class BFS2(object):def __init__(self, graph, s, leafDist, N):self.g = graph.graphself.Q = deque(); self.Q.append(s)self.dist = [INF] * N; self.dist[s] = 0while self.Q:v = self.Q.popleft()for i in self.g[v]:if self.dist[i] == INF:self.dist[i] = self.dist[v] + 1leafDist[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] = 1DFS(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 -= 1G.add_edge(a, b)G.add_edge(b, a)leafDist = [INF] * NBF = BFS(G, 0, leafDist, N)visit = [0] * Nvisit[0] = 1DFS(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()