HDU 3400 (三分)

#include <bits/stdc++.h>
using namespace std;
#define eps 1e-8
#define pi acos (-1)

struct point {
    double x, y;
    point (double _x = 0, double _y = 0) : x(_x), y(_y) {}
    point operator - (point a) const {
        return point (x-a.x, y-a.y);
    }
    point operator + (point a) const {
        return point (x+a.x, y+a.y);
    }
};

point operator * (point a, double p) {
    return point (a.x*p, a.y*p);
}

point pa, pb, pc, pd;
double a, b, c, t1, t2;

double dis (point a, point b) {
    double xx = a.x-b.x, yy = a.y-b.y;
    return sqrt (xx*xx + yy*yy);
}

double work (point from) {
    point p = pd-pc;
    double l = 0.0, r = 1.0, ll, rr, p1, p2;
    while (r-l > eps) {
        ll = (l*2+r)/3.0, rr = (l+2*r)/3.0;
        p1 = t2*(1-ll) + dis (from, pc+p*ll) / c;
        p2 = t2*(1-rr) + dis (from, pc+p*rr) / c;
        if (p1 > p2) {
            l = ll;
        }
        else
            r = rr;
    }
    return (p1+p2)/2;
}

double solve () {
    double l = 0.0, r = 1.0, ll, rr, p1, p2;
    point p = (pb-pa);
    while (r-l > eps) {
        ll = (l*2+r)/3.0, rr = (l+2*r)/3.0;
        p1 = ll*t1 + work (pa+p*ll), p2 = rr*t1 + work (pa+p*rr);
        if (p1 > p2) {
            l = ll;
        }
        else
            r = rr;
    }
    return (p1+p2)/2;
}

int main () {
    //freopen ("in", "r", stdin);
    int t;
    cin >> t;
    while (t--) {
        cin >> pa.x >> pa.y >> pb.x >> pb.y >> pc.x >> pc.y >> pd.x >> pd.y;
        cin >> a >> b >> c;
        point pp = pb-pa;
        t1 = dis (pa, pb) / a;
        t2 = dis (pc, pd) / b;
        printf ("%.2f\n", solve ());
    }
    return 0;
}