CF1641F.Covering Circle

普及/提高-

通过率:0%

AC君温馨提醒

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

题目描述

Sam started playing with round buckets in the sandbox, while also scattering pebbles. His mom decided to buy him a new bucket, so she needs to solve the following task.

You are given nn distinct points with integer coordinates A1,A2,,AnA_1, A_2, \ldots, A_n . All points were generated from the square [108,108]×[108,108][-10^8, 10^8] \times [-10^8, 10^8] uniformly and independently.

You are given positive integers kk , ll , such that klnk \leq l \leq n . You want to select a subsegment Ai,Ai+1,,Ai+l1A_i, A_{i+1}, \ldots, A_{i+l-1} of the points array (for some 1in+1l1 \leq i \leq n + 1 - l ), and some circle on the plane, containing k\geq k points of the selected subsegment (inside or on the border).

What is the smallest possible radius of that circle?

输入格式

Each test contains multiple test cases. The first line contains a single integer tt ( 1t1041 \leq t \leq 10^4 ) — the number of test cases. Descriptions of test cases follow.

The first line of each test case contains three integers nn , ll , kk ( 2kln500002 \leq k \leq l \leq n \leq 50\,000 , k20k \leq 20 ).

Each of the next nn lines contains two integers xix_i , yiy_i ( 108xi,yi108-10^8 \leq x_i, y_i \leq 10^8 ) — the coordinates of the point AiA_i . It is guaranteed that all points are distinct and were generated independently from uniform distribution on [108,108]×[108,108][-10^8, 10^8] \times [-10^8, 10^8] .

It is guaranteed that the sum of nn for all test cases does not exceed 5000050\,000 .

In the first test, points were not generated from the uniform distribution on [108,108]×[108,108][-10^8, 10^8] \times [-10^8, 10^8] for simplicity. It is the only such test and your solution must pass it.

Hacks are disabled in this problem.

输出格式

For each test case print a single real number — the answer to the problem.

Your answer will be considered correct if its absolute or relative error does not exceed 10910^{-9} . Formally let your answer be aa , jury answer be bb . Your answer will be considered correct if abmax(1,b)109\frac{|a - b|}{\max{(1, |b|)}} \le 10^{-9} .

输入输出样例

  • 输入#1

    4
    3 2 2
    0 0
    0 4
    3 0
    5 4 3
    1 1
    0 0
    2 2
    0 2
    2 0
    8 3 2
    0 3
    1 0
    0 2
    1 1
    0 1
    1 2
    0 0
    1 3
    5 4 4
    1 1
    -3 3
    2 2
    5 3
    5 5

    输出#1

    2.00000000000000000000
    1.00000000000000000000
    0.50000000000000000000
    4.00000000000000000000

说明/提示

In the first test case, we can select subsegment A1,A2A_1, A_2 and a circle with center (0,2)(0, 2) and radius 22 .

In the second test case, we can select subsegment A1,A2,A3,A4A_1, A_2, A_3, A_4 and a circle with center (1,2)(1, 2) and radius 11 .

首页