Ciel and Communications System

CodeChefOpen on judge ↗

Ciel has N restaurants on a long straight road. The coordinate of the i-th restaurant is Xi, and X1 ≤ X2 ≤ ... ≤ XN. Note that more than one restaurant can have the same coordinate. (They may be in the same building.) When the i-th restaurant communicates with the j-th restaurant (i j), a bit strange method is used. In the method, some towers are used. Each tower t has four parameters Y[t], R[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