NAIPC 2019

#### Start

2019-03-02 09:00 AKST

## NAIPC 2019

#### End

2019-03-02 14:00 AKST
The end is near!
Contest is over.
Not yet started.
Contest is starting in -1182 days 7:42:08

5:00:00

0:00:00

# Problem HRocket Powered Hovercraft

You are programming an autonomous rocket powered hovercraft. The vehicle can travel very, very fast, but turning is difficult. Since it’s hovering, it turns by firing directional thrusters, which will turn the vehicle whether it is moving forward or is stationary.

The salt flats on which you’re testing have been mapped with a 2D Cartesian grid. The hovercraft starts at location $(0{,}0)$ on this grid, facing in the positive $X$ direction. Your job is to get the vehicle to another location $(x{,}y)$ on the flats.

The hovercraft has a fixed ground speed $v$ miles per second and a fixed rate of rotation $w$ radians per second. Due to the power of the rockets both for acceleration and deceleration, it can attain its maximum speed virtually instantaneously, and come to a stop from maximum speed just as quickly. Likewise, it can begin rotating at its fixed rate instantaneously, and stop just as quickly. It can rotate either clockwise or counter-clockwise.

You must figure out the minimum amount of time to get the vehicle to its target. The program which controls the vehicle can start forward motion, stop forward motion, start rotating, and stop rotating, each exactly once. Note that starting/stopping forward movement can be independent of starting/stopping rotation.

## Input

Each test case will consist of exactly two lines.

The first line will contain two space-separated integers $x$ and $y$ ($-1\, 000\! \le \! x,y\! \le \! 1\, 000, (x{,}y){\neq }(0{,}0)$), which indicate the location on the grid mapped onto the flats that you are trying to reach, in units of miles.

The second line of input will contain two space-separated real numbers with exactly two decimal places: $v$ ($0.01\! \le \! v\! \le \! 10.00$) and $w$ ($0.01\! \le \! w\! \le \! 10.00$), where $v$ is the fixed speed of travel in miles per second, and $w$ is the fixed rate of rotation in either direction in radians per second.

## Output

Output a single real number, which is the minimum amount of time (in seconds) it would take get the hovercraft from $(0{,}0)$ to $(x{,}y)$ subject to the constraints. Your answer will be accepted if it is within an absolute error of $10^{-3}$.

Sample Input 1 Sample Output 1
20 0
1.00 0.10

20.00000000

Sample Input 2 Sample Output 2
-10 10
10.00 1.00

3.14159265

Sample Input 3 Sample Output 3
0 20
1.00 0.10

28.26445910

Sample Input 4 Sample Output 4
-997 -3
5.64 2.15

177.76915187