The Nearest Two — Solution & Editorial

Back to the Problem

Divide and conquer: split by x-median, recurse, then check a vertical strip of width √d sorted by y where only a constant number of neighbours per point matter.

Complexity: O(N log N)

Watch out: Comparing squared distances avoids sqrt precision issues; the strip only needs ~7 y-neighbours per point.