Hurry Up

Hurry Up
Accepted : 112		Submit : 393
Time Limit : 1000 MS		Memory Limit : 65536 KB

Problem Description GG is some what afraid of his MM. Once his MM asks, he will always try his best to rush to their home.  Obvious, he can run home in straight line directly. Alternatively, he can run to the main road and call the taxi. You can assume there is only one main road on the x-axis, with unlimited length. Given the initial location of GG and his destination, please help to ask the minimize time to get home. GG will always run at the fixed speed of vr, and the taxi can move at the fixed speed of vt  You can also assume that, only GG reach the main road, he can catch the taxi immediately. And the taxi will go towards home ( not necessay along the road ).  Bisides, GG can run arbitrary length, and pay arbitrarily for the taxi.  P.S. MM: abbr. Ma Ma Input Multiple test cases. First line, an integer T ( 1 ≤ T ≤ 2000 ), indicating the number of test cases.  For each test cases, there are 6 integers x1, y1, x2, y2, vr, vt in a line.  ( -1000 <= x1, y1, x2, y2 <= 1000, 1 <= vr < vt <= 1000 )  (x1, y1) : the initial location of GG  (x2, y2) : the destination location of GG  vr: GG's run speed  vt: taxi's speed Ouput For each test case, output a real number with 2 digits after the arithmetic point. It is the shorest time for GG to reach home. Sample Input 2 1 1 2 2 1 2 1 1 2 2 1 7 Sample Output 1.41 1.32 Source XTU OnlineJudge

/*

列方程，单峰函数，用三分法求最值即可

*/

#include
    
    
     
     
#include
     
     
      
      
#include
      
      
       
       
#include
       
       
        
        
using namespace std;
const double EPS=1e-9;
double x1, x2, yy, y2, vr, vc;

double f(double x)
{
    return sqrt(yy*yy + (x1 - x)*(x1 - x)) / vr + sqrt(y2*y2 + (x2 - x)*(x2 - x))/vc;
}
double ternary_search(double L, double R)
{
    double mid1, mid2;
    if (L > R)
        swap(L, R);
    while (R - L > EPS)
    {
        mid1 = L + (R - L) / 3;
        mid2 = R - (R - L) / 3;
        if (f(mid1) > f(mid2))
            L = mid1;
        else
            R = mid2;
    }
    return f((L + R)*0.5);
}
int main(void)
{
    int t;
    cin >> t;
    while (t--)
    {
        cin>>x1>>yy>>x2>>y2>>vr>>vc;
        double ans = sqrt((x1 - x2)*(x1 - x2) + (yy - y2)*(yy - y2))/vr;
        ans = min(ans, ternary_search(x1, x2));
        printf("%.2lf\n", ans);
    }
    return 0;
}
/*

2 
1 1 2 2 1 2
1 1 2 2 1 7



*/