Submission #7468793

---

Source Code Expand

from collections import deque

def resolve():
    # given
    N=int(input())
    G=list(range(N))
    E=[set() for _ in range(N)]
    for i in range(N-1):
        u,v=map(lambda x:int(x)-1,input().split())
        E[u].add(v)
        E[v].add(u)


    # query
    for _ in range(int(input())):
        start,goal=map(lambda x:int(x)-1,input().split())
        d=[float("inf") if i!=start else 0 for i in G]
        Q=deque([start])
        while(Q):
            u=Q.popleft()
            for v in E[u]:
                if d[v]>d[u]+1:
                    d[v]=d[u]+1
                    Q.append(v)
        # result
        print(d[goal]+1)
resolve()

Submission Info

Judge Result