P1429 Closest Pair of Points in the Plane (Enhanced Version)

[P7883](/problem/P7883) Closest Pair of Points in the Plane (Enhanced-Enhanced Version)

Given $n$ points in the plane, find the minimum distance among all pairs of points.

The first line contains $n$, with $2 \le n \le 200000$. Each of the next $n$ lines contains two integers $x$ and $y$, the $x$-coordinate and $y$-coordinate of a point, separated by a single space.

Output a single real number on one line: the shortest distance, rounded to $4$ decimal places.

The testdata guarantees $0 \le x, y \le 10^9$. Translated by ChatGPT 5