Intelligence in Perpendicularia | 프로그래밍의 벗 PivotOJ
PivotOJ

Intelligence in Perpendicularia

시간 제한: 3000ms메모리 제한: 512MB출처: NEERC Northern Subregional 2017BOJ 15139
이 문제는 본문 이미지 일부가 표시되지 않습니다. 텍스트만으로 풀이가 어려울 수 있습니다.

문제

There are only two directions in Perpendicularia: vertical and horizontal. Perpendicularia government are going to build a new secret service facility. They have some proposed facility plans and want to calculate total secured perimeter for each of them.

The total secured perimeter is calculated as the total length of the facility walls invisible for the perpendicularly-looking outside observer. The figure below shows one of the proposed plans and corresponding secured perimeter.

[이미지 1]

Write a program that calculates the total secured perimeter for the given plan of the secret service facility.

입력

The plan of the secret service facility is specified as a polygon.

The first line of the input contains one integer n — the number of vertices of the polygon (4 ≤ n ≤ 1000). Each of the following n lines contains two integers xi and yi – the coordinates of the i-th vertex (−106 ≤ xi, yi ≤ 106). Vertices are listed in the consecutive order.

All polygon vertices are distinct and none of them lie at the polygon’s edge. All polygon edges are either vertical (xi = xi+1 or horizontal (yi = yi+1) and none of them intersect each other.

출력

Output a single integer — the total secured perimeter of the secret service facility.

예제

예제 1

입력
10
1 1
6 1
6 4
3 4
3 3
5 3
5 2
2 2
2 3
1 3
출력
6
이 문제는 채점 준비 중입니다. 테스트 데이터가 확보되면 제출이 가능합니다.