Preparing NOJ

# Volatile Kite

2000ms 262144K

## Description:

You are given a convex polygon P with n distinct vertices p1, p2, ..., pn. Vertex pi has coordinates (xi, yi) in the 2D plane. These vertices are listed in clockwise order.

You can choose a real number D and move each vertex of the polygon a distance of at most D from their original positions.

Find the maximum value of D such that no matter how you move the vertices, the polygon does not intersect itself and stays convex.

## Input:

The first line has one integer n (4 ≤ n ≤ 1 000) — the number of vertices.

The next n lines contain the coordinates of the vertices. Line i contains two integers xi and yi ( - 109 ≤ xi, yi ≤ 109) — the coordinates of the i-th vertex. These points are guaranteed to be given in clockwise order, and will form a strictly convex polygon (in particular, no three consecutive points lie on the same straight line).

## Output:

Print one real number D, which is the maximum real number such that no matter how you move the vertices, the polygon stays convex.

Your answer will be considered correct if its absolute or relative error does not exceed 10 - 6.

## Sample Input:

40 00 11 11 0

## Sample Output:

0.3535533906

## Sample Input:

65 010 012 -410 -85 -83 -4

## Sample Output:

1.0000000000

## Note:

Here is a picture of the first sample

Here is an example of making the polygon non-convex.

This is not an optimal solution, since the maximum distance we moved one point is  ≈ 0.4242640687, whereas we can make it non-convex by only moving each point a distance of at most  ≈ 0.3535533906.

Info

Provider CodeForces

Origin VK Cup 2017 - Round 2

Code CF772B

Tags

geometry

Submitted 6

Passed 5

AC Rate 83.33%

Date 03/04/2019 15:50:49

Related

Nothing Yet