Codeforces Round #327 (Div. 2) D. Chip 'n Dale Rescue Rangers

阅读: 评论:0

Codeforces Round #327 (Div. 2) D. Chip 'n Dale Rescue Rangers

Codeforces Round #327 (Div. 2) D. Chip 'n Dale Rescue Rangers

      

        解题报告:Codeforces Round #327 problems analysis


D. Chip 'n Dale Rescue Rangers time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output

A team of furry rescue rangers was sitting idle in their hollow tree when suddenly they received a signal of distress. In a few moments they were ready, and the dirigible of the rescue chipmunks hit the road.

We assume that the action takes place on a Cartesian plane. The headquarters of the rescuers is located at point (x1, y1), and the distress signal came from the point (x2, y2).

Due to Gadget's engineering talent, the rescuers' dirigible can instantly change its current velocity and direction of movement at any moment and as many times as needed. The only limitation is: the speed of the aircraft relative to the air can not exceed  meters per second.

Of course, Gadget is a true rescuer and wants to reach the destination as soon as possible. The matter is complicated by the fact that the wind is blowing in the air and it affects the movement of the dirigible. According to the weather forecast, the wind will be defined by the vector (vx, vy) for the nearest t seconds, and then will change to (wx, wy). These vectors give both the direction and velocity of the wind. Formally, if a dirigible is located at the point (x, y), while its own velocity relative to the air is equal to zero and the wind (ux, uy) is blowing, then after  seconds the new position of the dirigible will be .

Gadget is busy piloting the aircraft, so she asked Chip to calculate how long will it take them to reach the destination if they fly optimally. He coped with the task easily, but Dale is convinced that Chip has given the random value, aiming only not to lose the face in front of Gadget. Dale has asked you to find the right answer.

It is guaranteed that the speed of the wind at any moment of time is strictly less than the maximum possible speed of the airship relative to the air.

Input

The first line of the input contains four integers x1, y1, x2, y2 (|x1|,  |y1|,  |x2|,  |y2| ≤ 10 000) — 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 tseconds and the wind that will blow at all the remaining time, respectively. It is guaranteed that  and .

Output

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 .

Sample test(s) input
0 0 5 5
3 2
-1 -1
-1 0
output
3.729935587093555327
input
0 0 0 1000
100 1000
-50 0
50 0
output
11.547005383792516398



#include#include#includeusing namespace std;
double pi=0.00000001;
int main()
{double x1,x2,y1,y2;double vmax,t,vx,vy,wx,wy;double l,r,kk;double mid=(l+r)/2;cin>>x1>>y1>>x2>>y2>>vmax>>t>>vx>>vy>>wx>>wy;if(sqrt((x1+t*vx-x2)*(x1+t*vx-x2)+(y1+t*vy-y2)*(y1+t*vy-y2))-vmax*t<=pi){l=0;r=t;while(r-l>pi){mid=(l+r)/2;kk=sqrt((x1+mid*vx-x2)*(x1+mid*vx-x2)+(y1+mid*vy-y2)*(y1+mid*vy-y2));if(abs(kk-vmax*mid)<=pi) break;if(kkpi){mid=(l+r)/2;kk=sqrt((t*vx+x1+mid*wx-x2)*(t*vx+x1+mid*wx-x2)+(t*vy+y1+mid*wy-y2)*(t*vy+y1+mid*wy-y2));if(abs(kk-(t+mid)*vmax)


本文发布于:2024-01-31 18:45:56,感谢您对本站的认可!

本文链接:https://www.4u4v.net/it/170669795630590.html

版权声明:本站内容均来自互联网,仅供演示用,请勿用于商业和其他非法用途。如果侵犯了您的权益请与我们联系,我们将在24小时内删除。

标签:Div   Codeforces   Chip   Rangers   Rescue
留言与评论(共有 0 条评论)
   
验证码:

Copyright ©2019-2022 Comsenz Inc.Powered by ©

网站地图1 网站地图2 网站地图3 网站地图4 网站地图5 网站地图6 网站地图7 网站地图8 网站地图9 网站地图10 网站地图11 网站地图12 网站地图13 网站地图14 网站地图15 网站地图16 网站地图17 网站地图18 网站地图19 网站地图20 网站地图21 网站地图22/a> 网站地图23