Point It!

CodeChefOpen on judge ↗

*This time, Raghu's problem was ridiculously silly, and Arnhav forgot what the problem was. So we'll leave the silly stuff and give you a formal statement - everything is already tough enough.* You are given a set $S$ consisting of $N$ points $w_1, .. ,w_N$ in the Euclidean plane, with integer coordinates. You have to answer $Q$ queries. In every query you are given two points, $u$ and $v$,

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