Sheldon and trains
CodeChefOpen on judge ↗
Sheldon loves trains. One day he decided to take a trip. He has a map of the train routes. He wants to find the total travel duration between any two given stations. A train traveling from station a to b will stop at all intermediate stations for a particular amount of time. The map has the following information: - The travel times between two consecutive stations. - The waiting times for all in
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.
Sign in to chat with the tutor and save your progress.
Sign in to start