백준 파이썬 2644번 촌수계산Silver 2 https://www.acmicpc.net/problem/2644 import sysinput = sys.stdin.readlinefrom collections import dequedef bfs(a, b): q = deque() q.append((a, 0)) q.append((b, 0)) visited[a], visited[b] = 0, 0 while q: x, dist = q.popleft() for i in tree[x]: if visited[i] == -1: dist += 1 q.append((i, dist)) ..
