Phasing through buildings

CodeChefOpen on judge ↗

There are $N$ buildings in BITS Pilani, Goa campus, numbered from 1 to N. Building 1 is the B-Dome. Each building has a phaser which teleports a student to another building. The destination of the phaser of building $i$ is town ai.It is guaranteed that a student can get to the B-Dome from any building by using the phasers a number of times. Find the minimum number of the Phasers whose destination

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI