← All problemsSign in

Investigation

CSESGraph AlgorithmsOpen on judge ↗

You are going to travel from Syrjälä to Lehmälä by plane. You would like to find answers to the following questions: - what is the minimum price of such a route? - how many minimum-price routes are there? (modulo 10^9+7) - what is the minimum number of flights in a minimum-price route? - what is the maximum number of flights in a minimum-price route? Input The first input line contains two i

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