← All problemsSign in

Abhijeet and his challenging race

Abhijeet and his friend Kshittiz are getting bored so, Abhijeet decided to give him a challenge. In the challenge, there is a map of a city where $N$ locations are marked and numbered from 1 to $N$. There are also $M$ bidirectional roads of length $w$ connecting the locations. It is actually a car race track and there are $K$ participants that will be participating in the race. All the participa

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