Roupaths
CodeChefOpen on judge ↗
R2D2 and BB8 have been challenged by the robotics team. They are given N points on a 2D plane and they need to move their robot from the first point to the Nth one, going only from left to right, from a point with a lower x coordinate to a higher one. Unfortunately, the team members also give them some restrictions for each point. These restrictions can be of 3 types: Type 0 : If the point has
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.
Sign in to chat with the tutor and save your progress.
Sign in to start