Interesting Points
CodeChefOpen on judge ↗
There are N distinct points given - P1,P2,P3,...,PN to be drawn on a 2-dimensional coordinate-system. You draw these points one by one in order. For each point Pi, previous k points, including the point Pi are termed as the point’s ancestors. k is calculated as follows : Given K, for a point Pi, k = i, if i-K K, otherwise Now for each point Pi, proximity is calculated. It is the manhattan dis
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