시간 제한메모리 제한제출정답맞힌 사람정답 비율
1 초 2048 MB2052100.000%

문제

Our local council discovered that its forest is overrun by invasive pests, and is considering its options for how to restore natural balance... By fire if necessary.

Experts insist that the correct plan of action is to set the forest alight, supposed 'prescribed burning', but you're not quite convinced that the plan is sound without a clear end. You should calculate the exact time the burn will finish and where, so that we can verify the blaze is out as soon as possible.

Given that the flames will be lit simultaneously along every edge of the forest and travel at a rate of $v$ ms$^{-1}$ through its interior, how long will it take for the entire forest to be set alight?

The forest has grown in the convenient shape of a simple polygon, with no holes, although it may or may not be convex and may have any winding order.

Figure A.1: Diagrams illustrating sample fires 1, 2, 3, and 4 respectively.

입력

The first line of input contains two integers $v$, and $n$, where $v$ ($1 \leq v \leq 10^5$) is the speed in ms$^{-1}$ of the fire, and $n$ ($3 \leq n \leq 500$) is the number of vertices in the polygon describing the forest.

The next $n$ lines each contain two integers, $x_i$ and $y_i$ ($0 \leq x_i, y_i \leq 10^5$), the coordinates of the $i^{th}$ vertex.

출력

Output the time taken for the entire forest to be set on fire.

On the next line, output the coordinates of the last point inside the forest to be set alight, or any one of them if there are multiple.

Your answers should have an absolute or relative error of at most $10^{-6}$.

예제 입력 1

2 4
0 0
1 2
4 2
3 0

예제 출력 1

0.5
1.61803399 1

예제 입력 2

1 3
0 0
1 3
4 2

예제 출력 2

0.926209683
1.58578644 1.82842712

예제 입력 3

1 8
9 10
5 15
10 11
15 15
11 10
15 5
10 8
5 5

예제 출력 3

1.25
10 9.25

예제 입력 4

1 6
1 2
0 0
5 1
4 2
5 3
0 4

예제 출력 4

1.47564675
2.47564721 2