← All problemsSign in

Temporal Graph Sah Kreedan

Mr. Y lives in the scientific town of Vigyanpura. Vigyanpura has $N$ houses and a network of $M$ portals that directly connect some of these houses. People of Vigyanpura often use these portals to travel from one house to another house when possible. For going from one house $U$ to another house $V$, one may need to visit multiple houses in the path from $U$ to $V$ in turn, may have to also cross

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

Sign in to chat with the tutor and save your progress.

Sign in to start