NWERC 2017 Open Contest

Start

2017-11-26 11:30 CET

NWERC 2017 Open Contest

End

2017-11-26 16:30 CET
The end is near!
Contest is over.
Not yet started.
Contest is starting in -235 days 2:49:12

Time elapsed

5:00:00

Time remaining

0:00:00

Problem G
Glyph Recognition

You are an archaeologist working at an excavation site where your team has found hundreds of clay tablets containing glyphs written in some ancient language. Not much is known about the language yet, but you know that there are only six different glyphs, each of them in the shape of a regular polygon with one vertex pointing to the right (see Figure 1(a) below). Only the boundary of each polygon is carved out of the clay.

\includegraphics[width=3.75cm]{alphabet.pdf}
(a) The six glyphs.
\includegraphics[width=5.25cm]{1-without.pdf}
(b) The first sample input.
\includegraphics[width=5.2cm]{1-triangle.pdf} \includegraphics[width=5.2cm]{1-hexagon.pdf}
(c) Fitting triangles and hexagons to the first
sample. The triangles’ score is higher.
Figure 1: Glyph recognition

You want to start analysing the language right away, so you need to get the text on the tablets into some machine readable format. Ideally, you would like to use an OCR (optical character recognition) tool for that, but you do not have one installed on your laptop and there is no internet connection at the site.

Because of this you have devised your own scheme to digitise the ancient writings: for every glyph on a tablet you first find a number of sample points that are in the carved out region, i.e. on the boundary of the polygon. Based on those sample points you then calculate a score for each of the six glyphs and mark the one with the highest score as the recognised glyph.

For a given number of corners $k$ ($3 \le k \le 8$), the score is computed as follows. Two regular $k$-gons are fitted to the sample points, one from the inside and one from the outside, such that the following hold:

  • Each polygon is centered at the origin, i.e. all vertices have equal distance to $(0,0)$.

  • Each polygon has a vertex on the positive $x$-axis.

  • The inner polygon is the largest such polygon containing none of the sample points.

  • The outer polygon is the smallest such polygon containing all of the sample points.

An example can be seen in Figure 1(c). The score for this value of $k$ is $\frac{A_\text {inner}}{A_\text {outer}}$, where $A_\text {inner}$ and $A_\text {outer}$ are the areas of the inner and outer polygon, respectively.

Given a set of sample points, find the glyph with the highest score.

Input

The input consists of:

  • One line with one integer $n$ ($1 \le n \le 1\, 000$), the number of sample points.

  • $n$ lines, each with two integers $x,y$ ($-10^6 \le x,y \le 10^6$), specifying a point at coordinates $(x,y)$.

No sample point is at the origin and all points are distinct.

Output

Output the optimal number of corners $k$ ($3 \le k \le 8$), followed by the score obtained for that value of $k$. Your answer will be accepted if the absolute error does not exceed $10^{-6}$. If several values of $k$ result in a score that is within $10^{-6}$ of the optimal score, any one of them will be accepted.

Sample Input 1 Sample Output 1
9
-4 -1
-4 6
-3 -6
-3 4
0 -4
2 -3
2 3
5 1
7 0
3 0.5625000000
Sample Input 2 Sample Output 2
4
1 0
0 1
-1 0
0 -1
8 1.0000000000