Logo
(追記) (追記ここまで)

18968번 - Circle Union 스페셜 저지다국어

시간 제한메모리 제한제출정답맞힌 사람정답 비율
2 초 256 MB133552738.028%

문제

An arrangement of several circles in the plane is interesting if there exists a point that lies inside or on the boundary of each circle. The covered region of an arrangement consists of all points that lie inside or on the boundary of at least one of the circle.

Consider $n$ circles of radii $r_1, \ldots, r_n$ respectively. Find the largest possible area of the region covered by these circles in an interesting arrangement.

입력

The first line contains a single integer $n$ (1ドル\leq n\leq 10^4$).

The second line contains $n$ integers $r_1, \ldots, r_n$ (1ドル\leq r_i\leq 10^3$).

출력

Print a single real number --- the largest possible covered area. Your answer will be considered correct if its absolute or relative error doesn't exceed 10ドル^{-6}$.

제한

예제 입력 1

3
10 9 8

예제 출력 1

726.4578311468

힌트

출처

Camp > Petrozavodsk Programming Camp > Summer 2018 > Day 3: MIPT Contest C번

(追記) (追記ここまで)

출처

대학교 대회

  • 사업자 등록 번호: 541-88-00682
  • 대표자명: 최백준
  • 주소: 서울시 서초구 서초대로74길 29 서초파라곤 412호
  • 전화번호: 02-521-0487 (이메일로 연락 주세요)
  • 이메일: contacts@startlink.io
  • 통신판매신고번호: 제 2017-서울서초-2193 호

AltStyle によって変換されたページ (->オリジナル) /