同和创作矩阵 › ›博文归档› 技术博文归档 › 查看内容

22668_Convexhu

2022-5-16 18:22| 发布者: Hocassian| 查看: 16| 评论: 0|原作者: 肇庆学院ACM合集

摘要:

C:\Users\Administrator\Downloads\2019-10-12-10-14-5-89506838406200-Problem List-采集的数据-后羿采集器.html

Pro.ID

22668

Title

Convex hull

Title链接

http://10.20.2.8/oj/exercise/problem?problem_id=22668

AC

Submit

Ratio

时间&空间限制

Time Limit: 1000/500 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)

描述

There are M circles ( 0 ≤ M ≤ 100 ) on a plane. Some circles can have zero radius.

The task is to calculate the area of minimum convex domain containing all the circles.

输入

Input contains the description of one test including:

a line with value M;
M lines; every line contains coordinates of the center and the radius for one circle. These are real numbers separated by spaces.

输出

Description

There are M circles ( 0 ≤ M ≤ 100 ) on a plane. Some circles can have zero radius.

The task is to calculate the area of minimum convex domain containing all the circles.

Input

Input contains the description of one test including:

a line with value M;
M lines; every line contains coordinates of the center and the radius for one circle. These are real numbers separated by spaces.

Output

Output a single line with the result given with accuracy 10^-4.

Sample Input

4
0 0 1
0 4 1
4 4 1
4 0 1

Sample Output

35.1416

Source

NEERC 2001 Western Subregion

样例输入