RiseOJ는 solved.ac와 제휴 관계가 없습니다. 티어 아이콘 © solved.ac. solved.ac
포럼
COCI00230

Setnja

Unrated 레이팅 미적용
난이도
1s
시간 제한
256MB
메모리 제한
0
맞았습니다!!
0
제출 수
0.0%
정답률
레이팅

의견: 0

설명

\(7^{th}\) round (Croatian Olympiad in Informatics), April \(28^{th}\), 2012

Mirko is taking all his friends to a Zaz concert soon to be held in Zagreb. He has already obtained the
tickets, and is now walking around the neighbourhood delivering them to everyone.
Mirko's neighbourhood can be represented by a Cartesian plane. While walking, Mirko is stepping only
on lattice (integ\(er-co\)ordinates) points of that plane. He takes a single step to move to any one of
eight adjacent lattice points (up, down, left, right, or diagonally in any direction).
Each one of Mirko's friends also lives at some lattice point (x, y), and is willing to walk some distance
to meet him. Specifically, Mirko will meet a given friend at some lattice point with distance of at most
P steps from this friend's house, with P depending on the specific friend's laziness.
After finishing his stroll, Mirko has recalled the order in which he has met with his friends. Compute
the minimum possible number of steps that Mirko had to make during his stroll. Mirko's starting
and ending position are not known.

제약

In test data worth a total of 30 points, all numbers in the input (including N) will be at most 200.
In test data worth an additional 30 points, no friend will have P greater than 10.

입력 형식

The first line of input contains the positive integer N (\(2 \le N \le 200\,000\)), the number of Mirko's
friends.
Each of the following N lines contains three integers describing one friend: x, y, and P (\(0 \le x\), y, P ≤
200 000). Friends are given in the order in which Mirko has met them.

출력 형식

The first and only line of output must contain the required minimum possible number of steps that
Mirko had to make.

예제 1
입력
3
3 10 2
8 4 2
2 5 2
출력
4
예제 2
입력
4
3 3 5
7 11 5
20 8 10
30 18 3
출력
19

First sample description: Mirko could have started his stroll at coordinates (4, 8), met the first friend,
taken two steps to the point (6, 6), met the second friend, taken two steps to the point (4, 5) and met
the third friend there.
문제 정보

생성자가 기록되지 않았습니다.

출처 COCI 2011/2012 Olympiad

평가 및 의견

Setnja

개요
출제자 난이도 Unrated 레이팅 미적용 의견 0 / 50 공개 집계 (커뮤니티 난이도, 주요 주제, 품질)는 의견이 충분히 모이면 공개됩니다.

Log in to rate problems.

개별 의견

아직 의견이 없습니다. 자격이 된다면 위 양식에서 가장 먼저 평가해 보세요.

풀이 제출

Setnja

게스트로 둘러보고 있습니다. 로그인하면 풀이를 제출하고 진행 상황을 확인할 수 있습니다. 로그인하고 제출하기
공개
C++20 Tab 들여쓰기 · Ctrl+/ 주석 토글 · Enter 자동 들여쓰기
1 1 1 0 공백: 4 · UTF-8