Hawk & Thrones

CodeChefOpen on judge ↗

In the Dragonland, there reign $N$ nobles numbered from $1 to N$ and there are $M$ friendships between these nobles represented by $M$ pairs of integers. Hawk plans to invade all of these nobles and he plans to invade the Dragonland in a certain order represented by an array order of length $N$ where **order[i]** is noble to be attacked on the **ith** day. After a noble is defeated then all its fr

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