← All problemsSign in

Annual Parade

CodeChefRating 2862Open on judge ↗

In the magic land, there is an annual parade hold on each spring. There are N cities in magic land, and M directed roads between cities. On the parade, there will be some(may be 0) heroes travel in this land, for each hero: He start at city begin[i], traveling to some cities, and finish at city end[i]. Note that: begin[i] may be equals to end[i], but he must at least moved to another city du

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