[백준] 15681번 트리와 쿼리 (파이썬)

15681번: 트리와 쿼리

 

코드

import sys
sys.setrecursionlimit(10**9)

n, r, q = map(int, sys.stdin.readline().split(" "))
li = [[] for _ in range(n+1)]
for _ in range(n-1):
    u, v = map(int, sys.stdin.readline().split(" "))
    li[u].append(v)
    li[v].append(u)

tree = [[] for _ in range(n+1)]
def makeTree(currentNode, parent):
    for node in li[currentNode]:
        if node != parent:
            tree[currentNode].append(node)
            makeTree(node, currentNode)

makeTree(r,-1)

subtree = [[] for _ in range(n+1)]
def countSubtreeNodes(currentNode):
    subtree[currentNode] = 1
    for node in tree[currentNode]:
        countSubtreeNodes(node)
        subtree[currentNode] += subtree[node]

countSubtreeNodes(r)
for _ in range(q):
    query = int(sys.stdin.readline())
    print(subtree[query])