Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|

Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest |

Language: Parabolic teleports
Description Flatland is a plane with a Cartesian coordinate system 1. Consequently, the minimal time it takes for a Flatlander to move from point V to point W is equal to the length of the line segment VW. This fact is taught in the schools of Flatland as the “shortest path theorem”.However, since George Edward Nius invented the devices called The points ( After inventing the teleports, G.E.Nius founded a company to build them. At the moment, the company has already built But in practice, the Flatlanders still think the shortest path theorem is true and nobody has even tried the parabolic teleports. To help the situation, G.E.Nius has hired you to write a program that, given two points Are you up to the task? Input On the first line of the file is the integer Y (−100 ≤ _{V}X ≤ 100, −_{V}Y ≤ _{V}V. On the third line of the file are the integers X and _{W}Y (−100 ≤ _{W}X ≤ 100, −_{W}Y ≤ _{W}W.Each of the B, _{i}C, _{i}XL, _{i}XR (‑100 ≤ _{i}A, _{i}B, _{i}C ≤ 100, _{i}A ≠ 0, −100 ≤ _{i}XL < _{i}XR ≤ 100)._{i}Output The first and only line of the file should contain one real number, the minimal time it takes to move from point Sample Input 2 0 10 0 -10 1 0 0 -10 10 -1 0 0 -10 10 Sample Output 6.2450 Source Northeastern Europe 2005, Western Subregion |

[Submit] [Go Back] [Status] [Discuss]

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di

Any problem, Please Contact Administrator