영어 원문입니다. 원문의 수식·표를 글자로 옮겨 모양이 다를 수 있습니다. 정확한 내용은 원문 페이지에서 확인하세요. 원문 페이지 열기 (새 창)
시간 제한 1초 · 메모리 제한 512 MB
Problem
Given a set of points in the two-dimensional plane, your task is to find the minimum Euclidean distance between two distinct points.
The Euclidean distance of points (x_1,y_1) and (x_2,y_2) is √((x_1-x_2)^2+(y_1-y_2)^2).
Input
The first input line has an integer n: the number of points.
After this, there are n lines that describe the points. Each line has two integers x and y. You may assume that each point is distinct.
Output
Print one integer: d^2 where d is the minimum Euclidean distance (this ensures that the result is an integer).
Constraints
- 2 ≤ n ≤ 2 · 10^5
- -10^9 ≤ x,y ≤ 10^9
예제
예제 1
4 2 1 4 4 1 2 6 3
2