Bob and GF

CodeChefOpen on judge ↗

Bob is single and he is finding GF and he is able to find one. Bob is currently at their home and want to go to his GF's home . There is $n$ house in his village chefland where he and his GF living and $m$ roads organized in such ways that he can go from one house to near house by going from roof or step down stair of current house and step up stair of nearby house. It take $c_i$ time to

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