Save Sita

CodeChefOpen on judge ↗

Ravana has imprisoned Sita in Ashokavana. Ram is trying to save Sita. Ravana has added some obstacles and water bodies. Initially Ram has to collect all the gold coins on the field. He can walk on water bodies only if he has ALL the gold coins with him. If there are no coins at all, he can never walk on water. He can walk on empty cells. Find the minimum number of steps Ram will take to meet Sita.

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