영어 원문입니다. 원문의 수식·표를 글자로 옮겨 모양이 다를 수 있습니다. 정확한 내용은 원문 페이지에서 확인하세요. 원문 페이지 열기 (새 창)
시간 제한 1초 · 메모리 제한 512 MB
Problem
Given a set of n points in the two-dimensional plane, your task is to determine the convex hull of the points.
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: the coordinates of a point.
You may assume that each point is distinct, and the area of the hull is positive.
Output
First print an integer k: the number of points in the convex hull.
After this, print k lines that describe the points. You can print the points in any order. Print all points that lie on the convex hull.
Constraints
- 3 ≤ n ≤ 2 · 10^5
- -10^9 ≤ x, y ≤ 10^9
예제
예제 1
6 2 1 2 5 3 3 4 3 4 4 6 3
4 2 1 2 5 4 4 6 3