Submission #5997964

---

Source Code Expand

n = int(input())
graph = {}
for i in range(n - 1):
    x, y = map(int, input().split())
    graph.setdefault(x, [])
    graph.setdefault(y, [])
    graph[x].append(y)
    graph[y].append(x)

q = int(input())
for i in range(q):
    a, b = map(int ,input().split())
    queue = [a]
    distance = {a:0}
    while queue:
        test = queue.pop(0)
        for j in graph[test]:
            if j in distance:
                continue
            distance[j] = distance[test] + 1
            queue.append(j)
        if b in distance:
            print(distance[b] + 1)
            break

Submission Info

Judge Result