Codeforces Round 158 (Div. 2)
E
Dividing Kingdom
Codeforces
2500
原题
← D→
翻译中…

A country called Flatland is an infinite two-dimensional plane. Flatland has $*n*$ cities, each of them is a point on the plane.

翻译中…

Flatland is ruled by king Circle IV. Circle IV has 9 sons. He wants to give each of his sons part of Flatland to rule. For that, he wants to draw four distinct straight lines, such that two of them are parallel to the $*Ox*$ axis, and two others are parallel to the $*Oy*$ axis. At that, no straight line can go through any city. Thus, Flatland will be divided into 9 parts, and each son will be given exactly one of these parts. Circle IV thought a little, evaluated his sons' obedience and decided that the $*i*$-th son should get the part of Flatland that has exactly $*a*_{*i*}$ cities.

翻译中…

Help Circle find such four straight lines that if we divide Flatland into 9 parts by these lines, the resulting parts can be given to the sons so that son number $*i*$ got the part of Flatland which contains $*a*_{*i*}$ cities.

翻译中…

Input

翻译中…

The first line contains integer $*n* (9 ≤ *n* ≤ 10^{5})$ — the number of cities in Flatland. Next $*n*$ lines each contain two space-separated integers: $*x*_{*i*}, *y*_{*i*} ( - 10^{9} ≤ *x*_{*i*}, *y*_{*i*} ≤ 10^{9})$ — the coordinates of the $*i*$-th city. No two cities are located at the same point. The last line contains nine space-separated integers: image.

翻译中…

Output

翻译中…

If there is no solution, print a single integer -1.

翻译中…

Otherwise, print in the first line two distinct real space-separated numbers: $*x*_{1}, *x*_{2}$ — the abscissas of the straight lines that are parallel to the $*Oy*$ axis. And in the second line print two distinct real space-separated numbers: $*y*_{1}, *y*_{2}$ — the ordinates of the straight lines, parallel to the $*Ox*$. If there are multiple solutions, print any of them.

翻译中…

When the answer is being checked, a city is considered to lie on a straight line, if the distance between the city and the line doesn't exceed $10^{ - 6}$. Two straight lines are considered the same if the distance between them doesn't exceed $10^{ - 6}$.

翻译中…

Note

翻译中…

The solution for the first sample test is shown below:

翻译中…

image

翻译中…

The solution for the second sample test is shown below:

翻译中…

image

翻译中…

There is no solution for the third sample test.

翻译中…

样例

Input #1
9
1 1
1 2
1 3
2 1
2 2
2 3
3 1
3 2
3 3
1 1 1 1 1 1 1 1 1
Output #1
1.5000000000 2.5000000000
1.5000000000 2.5000000000
InputCopy OutputCopy
Input #2
15
4 4
-1 -3
1 5
3 -4
-4 4
-1 1
3 -3
-4 -5
-3 3
3 2
4 1
-4 2
-2 -5
-3 4
-1 4
2 1 2 1 2 1 3 2 1
Output #2
-3.5000000000 2.0000000000
3.5000000000 -1.0000000000
InputCopy OutputCopy
Input #3
10
-2 10
6 0
-16 -6
-4 13
-4 -2
-17 -10
9 15
18 16
-5 2
10 -5
2 1 1 1 1 1 1 1 1
Output #3
-1
InputCopy OutputCopy
题目信息
题号
260E
时间限制
2 s
内存限制
256 MB
标签
二分
暴力
数据结构

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。