（HDU - 3400）Line belt

（HDU - 3400）Line belt

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 4640 Accepted Submission(s): 1796

Problem Description

In a two-dimensional plane there are two line belts, there are two segments AB and CD, lxhgww’s speed on AB is P and on CD is Q, he can move with the speed R on other area on the plane.
How long must he take to travel from A to D?

Input

The first line is the case number T.
For each case, there are three lines.
The first line, four integers, the coordinates of A and B: Ax Ay Bx By.
The second line , four integers, the coordinates of C and D:Cx Cy Dx Dy.
The third line, three integers, P Q R.
0<= Ax，Ay，Bx，By，Cx，Cy，Dx，Dy<=1000
1<=P，Q，R<=10

Output

The minimum time to travel from A to D, round to two decimals.

Sample Input

1
0 0 0 100
100 0 100 100
2 2 1

Sample Output

136.60

题目大意：二维平面上有两条传送ab，cd，物体在传送带ab上的速度是p，在传送带cd上的速度是q，在其他地方的速度是r，问物体从a到d所需的时间最小是多少。

思路：最小的时间必然是在ab上走一段，cd上走一段，ab，cd之间走一段，设ab上的转折点为m，cd上的转折点为n，则时间