| 시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
|---|---|---|---|---|---|
| 6 초 | 512 MB | 36 | 11 | 7 | 43.750% |
You are given $n$ blue points and $m$ yellow points. You need to find a circle such that all blue points are located outside or on the boundary of this circle, and all yellow are located inside or on the boundary of this circle.
The tests for this problem were generated in such a way that, for each test case, there exists a circle with the following properties:
To check when your answer will be considered correct, see output format.
The first line contains $t,ドル the number of test cases you need to solve (1ドル \le t \le 10^5$).
The first line of each test case contains an integer $n,ドル the number of blue points (1ドル \le n \le 50,000円$).
Each of the next $n$ lines contains two integers $x$ and $y$: the coordinates of a blue point ($-10^9 \le x, y \le 10^9$).
The next line contains an integer $m,ドル the number of yellow points (1ドル \le m \le 50,000円$).
Each of the next $m$ lines contains two integers $x$ and $y$: the coordinates of a yellow point ($-10^9 \le x, y \le 10^9$).
It is guaranteed that, in each test case, all points (blue and yellow) are pairwise distinct. Additionally, the sum of $n$ over all test cases does not exceed 50ドル,000円,ドル and the sum of $m$ over all test cases does not exceed 50ドル,000円$.
For each test case, output two lines.
On the first line, output a real number $r,ドル the radius of your circle.
On the second line output two real numbers $x$ and $y,ドル the coordinates of the center of your circle.
Your answer will be considered correct if:
3 3 3 1 1 3 4 5 3 3 3 4 3 3 4 2 0 0 -1 -1 2 1 1 2 2 4 2 0 0 2 -2 0 0 -2 4 1 0 0 1 -1 0 0 -1
1.001 3 3 1.000 1.5 1.5 1.001 0 0