|
| 1 | +import sys |
| 2 | +from collections import defaultdict, deque |
| 3 | + |
| 4 | +read = lambda: sys.stdin.readline().rstrip() |
| 5 | + |
| 6 | + |
| 7 | +class Problem: |
| 8 | + def __init__(self): |
| 9 | + self.n, self.r, self.q = map(int, read().split()) |
| 10 | + |
| 11 | + self.edges = defaultdict(list) |
| 12 | + for _ in range(self.n - 1): |
| 13 | + x, y = map(int, read().split()) |
| 14 | + self.edges[x].append(y) |
| 15 | + self.edges[y].append(x) |
| 16 | + |
| 17 | + self.queries = [int(read()) for _ in range(self.q)] |
| 18 | + |
| 19 | + def solve(self) -> None: |
| 20 | + children = self.find_children(self.r) |
| 21 | + |
| 22 | + for query in self.queries: |
| 23 | + print(children[query]) |
| 24 | + |
| 25 | + def find_children(self, num: int) -> list[int]: |
| 26 | + stack, cached = deque([(num, -1)]), [] |
| 27 | + |
| 28 | + while stack: |
| 29 | + node, head = stack.pop() |
| 30 | + cached.append((node, head)) |
| 31 | + |
| 32 | + for child in self.edges[node]: |
| 33 | + if child != head: |
| 34 | + stack.append((child, node)) |
| 35 | + |
| 36 | + children = [1] * (self.n + 1) |
| 37 | + for node, head in reversed(cached): |
| 38 | + if head != -1: |
| 39 | + children[head] += children[node] |
| 40 | + |
| 41 | + return children |
| 42 | + |
| 43 | + |
| 44 | +if __name__ == "__main__": |
| 45 | + Problem().solve() |
0 commit comments