PLATFORME | 프로그래밍의 벗 PivotOJ
PivotOJ

PLATFORME

시간 제한: 2000ms메모리 제한: 128MB출처: CHC 2008 Regional Competition - SeniorsBOJ 1276
이 문제는 본문 이미지 일부가 표시되지 않습니다. 텍스트만으로 풀이가 어려울 수 있습니다.

문제

A level is being designed for a new platform game. The locations of the platforms have been chosen. Contrary to popular opinion, platforms can't float in the air, but need pillars for support. More precisely, each of the two ends of the platform needs to be supported by a pillar standing on the floor or on a different platform. 

You will be given the locations of the platforms in a coordinate system as in the left image below. Each platform's location is determined by its altitude (vertical distance from the ground) and the start and end coordinates in the horizontal direction. Each support pillar is placed half a unit from the end of a platform, as in the right image. 

Determine the total length of pillars needed to support all the platforms. 

[이미지 1] [이미지 2]
Example level with three platforms. The lowest platform is at altitude 1, the second lowest at altitude 3 and the third at altitude 5. The total length of pillars needed to support all platforms is 14.

입력

The first line contains the integer N, 1 ≤ N ≤ 100, the number of platforms. 

Each of the following N lines contains the position of one platform, three coordinates Y, X1 and X2The first number is the altitude, the other two the horizontal coordinates. All coordinates will be positive integers less than 10000 satisfying X2 > X1+1 (i.e. the length of each platform will be at least 2). 

The input will be such that no two platforms overlap. 

출력

Output the total length of pillars needed to support all the platforms. 

예제

예제 1

입력
3
1 5 10
3 1 5
5 3 7
출력
14

예제 2

입력
5
50 50 90
40 40 80
30 30 70
20 20 60
10 10 50
출력
200
코드를 제출하려면 로그인하세요.