CF590B.Chip 'n Dale Rescue Rangers
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
The first line of the input contains four integers x1 , y1 , x2 , y2 ( ∣x1∣,∣y1∣,∣x2∣,∣y2∣<=10000 ) — the coordinates of the rescuers' headquarters and the point, where signal of the distress came from, respectively.
The second line contains two integers 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 (vx,vy) and (wx,wy) , describing the wind for the first t seconds and the wind that will blow at all the remaining time, respectively. It is guaranteed that and
.
输入格式
Print a single real value — the minimum time the rescuers need to get to point (x2,y2) . 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 .
输出格式
无
输入输出样例
输入#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