CF1936F.Grand Finale: Circles

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

The first line contains a single integer nn ( 1n1051 \le n \le 10^5 ) — the number of circles.

The ii -th of the following nn lines contains three integers xix_i , yiy_i , rir_i ( 106xi,yi106-10^6 \le x_i,y_i \le 10^6 , 1ri21061 \le r_i \le 2 \cdot 10^6 ).

It is guaranteed that there is a circle with a radius of at least 10610^{-6} which is contained inside all nn circles.

输入格式

Output three real values, xx , yy , and rr — the coordinates of the center and the radius of the circle.

输出格式

A two-dimensional plot depicting the first test case is given below. The output circle CC is dashed with blue lines.

A two-dimensional plot depicting the second test case is given below. The output circle CC is dashed with blue lines.

输入输出样例

  • 输入#1

    4
    1 1 3
    -1 1 3
    1 -1 2
    -1 -1 2

    输出#1

    0.0000000000000000 -0.7637626158259733 0.9724747683480533
  • 输入#2

    4
    41580 -23621 95642
    -41580 -23621 95642
    0 47821 95642
    0 0 109750

    输出#2

    0.0000000000000000 0.0000000000000000 47821.0000000000000000

说明/提示

A two-dimensional plot depicting the first test case is given below. The output circle CC is dashed with blue lines.

A two-dimensional plot depicting the second test case is given below. The output circle CC is dashed with blue lines.

首页