Problem - Planets Queries II

Problem: There are $n$ planets. Each planet has a teleporter to exactly one other planet. Given queries $(a, b)$, find the minimum teleportations to get from $a$ to $b$, or report it's impossible.

Link: CSES 1160

Constraints:

• $1 \leq n, q \leq 2 \times 10^5$

Note: Each planet has exactly one outgoing teleporter. This is a functional graph.