题库练习 Chip 'n Dale Rescue Rangers
← 上一题 下一题 →

A9970 | Chip 'n Dale Rescue Rangers

时间限制1s
内存限制256MB
通过 / 提交0/0

题目描述

The first line of the input contains four integers $x_{1}$ , $y_{1}$ , $x_{2}$ , $y_{2}$ ( $|x_{1}|,|y_{1}|,|x_{2}|,|y_{2}|<=10000$ ) — the coordinates of the rescuers' headquarters and the point, where signal of the distress came from, respectively.

The second line contains two integers ![](/uploads/acgo/image/7354663a04520ad9_e8c75340d5b9.jpeg) and $t$ ( $0<v,t<=1000$ ), which are denoting the maximum speed of the chipmunk dirigible relative to the air and the moment of time when the wind changes according to the weather forecast, respectively.

Next follow one per line two pairs of integer $(v_{x},v_{y})$ and $(w_{x},w_{y})$ , describing the wind for the first $t$ seconds and the wind that will blow at all the remaining time, respectively. It is guaranteed that ![](/uploads/luogu/CF590B/77498d5270b13c87f7008af149ffd02dbff34b3d_662c5cc60709.png) and ![](/uploads/acgo/image/8656e5a579fd28e8_c2b425e03b61.jpeg).

输入格式

Print a single real value — the minimum time the rescuers need to get to point $(x_{2},y_{2})$ . You answer will be considered correct if its absolute or relative error does not exceed $10^{-6}$ .

Namely: let's assume that your answer is $a$ , and the answer of the jury is $b$ . The checker program will consider your answer correct, if ![](/uploads/acgo/image/ca6ec0fb8c699bc9_8bf50d84a444.jpeg).

输出格式

无

输入输出样例

输入 #1
0 0 5 5
3 2
-1 -1
-1 0
输出 #1
3.729935587093555327
输入 #2
0 0 0 1000
100 1000
-50 0
50 0
输出 #2
11.547005383792516398
C++ 编辑器
输入
输出