AtCoder Problems Hard No.91~100解説 - Qiita

from collections import deque N = int(input()) G = [] for _ in range(N): G.append([]) for i in range(N-1): a, b = map(int, input().split()) a -= 1 b -= 1 G[a].append((b, i)) G[b].append((a, i)) k = 0 for i in range(len(G)): k = max(k, len(G[i])) col = [0]*(N-1) Q = deque([(0, 0)]) visited = [False]*N while Q: #xは頂点、cは色 x, c = Q.popleft() visited[x] = True tmp_c = 1 #yは頂点、eは辺の番号 for y, e in G[x]: i