영어 원문입니다. 원문의 수식·표를 글자로 옮겨 모양이 다를 수 있습니다. 정확한 내용은 원문 페이지에서 확인하세요. 원문 페이지 열기 (새 창)
시간 제한 1초 · 메모리 제한 512 MB
Problem
Given a polygon, your task is to calculate the number of lattice points inside the polygon and on its boundary. A lattice point is a point whose coordinates are integers.
The polygon consists of n vertices (x_1,y_1),(x_2,y_2),…,(x_n,y_n). The vertices (x_i,y_i) and (x_{i+1},y_{i+1}) are adjacent for i=1,2,…,n-1, and the vertices (x_1,y_1) and (x_n,y_n) are also adjacent.
Input
The first input line has an integer n: the number of vertices.
After this, there are n lines that describe the vertices. The ith such line has two integers x_i and y_i.
You may assume that the polygon is simple, i.e., it does not intersect itself.
Output
Print two integers: the number of lattice points inside the polygon and on its boundary.
Constraints
- 3 ≤ n ≤ 10^5
- -10^9 ≤ x_i, y_i ≤ 10^9
예제
예제 1
4 1 1 5 3 3 5 1 4
6 8