codeforces 5D Follow Traffic Rules

D. Follow Traffic Rules

time limit per test

1 second

memory limit per test

64 megabytes

input

standard input

output

standard output

Everybody knows that the capital of Berland is connected to Bercouver (the Olympic capital) by a direct road. To improve the road's traffic capacity, there was placed just one traffic sign, limiting the maximum speed. Traffic signs in Berland are a bit peculiar, because they limit the speed only at that point on the road where they are placed. Right after passing the sign it is allowed to drive at any speed.

It is known that the car of an average Berland citizen has the acceleration (deceleration) speed of a km/h2, and has maximum speed of vkm/h. The road has the length of l km, and the speed sign, limiting the speed to w km/h, is placed d km (1 ≤ d < l) away from the capital of Berland. The car has a zero speed at the beginning of the journey. Find the minimum time that an average Berland citizen will need to get from the capital to Bercouver, if he drives at the optimal speed.

The car can enter Bercouver at any speed.

Input

The first line of the input file contains two integer numbers a and v (1 ≤ a, v ≤ 10000). The second line contains three integer numbersl, d and w (2 ≤ l ≤ 10000; 1 ≤ d < l; 1 ≤ w ≤ 10000).

Output

Print the answer with at least five digits after the decimal point.

题目大意是有一条路长度为l km，在路上d km处有一个限速标志 要求在该点的速度 <= w km/h

所有的汽车的最大速度为v km/h，加速（减速）时的最大加速度（减速度）为a a km/h2，

求通过这条路的最短时间。

好吧，这就是一个高中生的物理题目，就是要多分点情况考虑一下。

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <string>
#include <stack>
#include <map>
#include <queue>
#include <algorithm>
using namespace std;

//solve a*x^2 + bx + c = 0; get its positive solution
double solve_equ(double a, double b, double c) {
    return (sqrt(b*b-4*a*c) - b ) / 2 / a;
}

//initial speed is v0, max v is maxv
//acceleration is a, distance is s
//get the mininum time
double solve(double v0, double maxv, double a, double s) {
    double acs = (maxv * maxv - v0 *v0) / a / 2;
    if (acs > s) return solve_equ(a/2, v0, -s);

    return ((maxv - v0) / a + (s - acs) / maxv);
}

int main() {
    double a,v,l,d,w;
    scanf("%lf %lf %lf %lf %lf", &a, &v, &l, &d, &w);

    double ans = 0;
    if (v <= w) {
NO_LIMIT:
        ans = solve(0, v, a, l);
    } else {
        double start = (2 * v * v - w * w) / 2 / a; 
        if (start < d) {
            ans += ((2 * v - w) / a); // v/a + (v-w)/a
            ans += ((d - start) / v); // move with constant speed
        } else {
            if (w * w / a / 2 < d) {
                ans += w / a + 2 * solve_equ(a, 2 * w, w * w / 2 / a - d);//time to get d
            } else {
                goto NO_LIMIT;
            }
        }
        ans += solve(w, v, a, l-d); // time after d
    }

    printf("%.5lf\n", ans);
    return 0;
}