Planets Queries II - Analysis

Pattern recognition:

• Exactly one outgoing edge per node = functional graph
• Structure: trees leading into cycles
• Need distance queries

Approach: $1.$ Find cycles and identify which cycle each node eventually reaches

$2.$ Compute distance from each node to its cycle

$3.$ For query $(a, b)$:

• If $b$ is an ancestor of $a$ (in the tree part), answer is depth difference
• If both reach the same cycle, compute cycle distance
• Otherwise, impossible

This requires careful decomposition of the functional graph.