Travel Pass

CodeChefRating 1118Open on judge ↗

Chef is going on a road trip and needs to apply for inter-district and inter-state travel e-passes. It takes $A$ minutes to fill each inter-district e-pass application and $B$ minutes for each inter-state e-pass application. His journey is given to you as a binary string $S$ of length $N$ where $0$ denotes crossing from one district to another district (which needs an inter-district e-pass), and

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