Stepping Up

CodeChefOpen on judge ↗

Statement Given a directed graph G with N vertices and M edges. For each vertex u, you must assign positive integer F(u) such that: - For each edge e from a to b, F(b) > F(a) - The maximum value m = max( F(u) ) is minimized Output the maximum value m. If no such assignment is possible output "IMPOSSIBLE" (quotes for clarity). INPUT FORMAT First line of input contains a number t, the number o

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