Line belt 三分嵌套

 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

因为有两个变量所以用两个三分
用cin会tle。。。没想到会在这超时。。。

#include <cstdio>
#include <cstring>
#include <iostream>
#include <cmath>
#inclu