B2 - Mayor Ram & Portals (Slightly Hard Version )

CodeChefOpen on judge ↗

_Problem statements for this and the Easy version are **not** same. Read the constraint mentioned in the problem statement._ Mayor Ram is back! This time on his vacation he invented a new Portal Chain Machine. This machine has $N$ portals numbered from $1$ to $N$ from left to right. Each of these portals also has a value associated with itself. These values are all distinct and lie between $1$ t

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