CodeForces - 5D Follow Traffic Rules【物理题】

最新推荐文章于 2022-02-09 22:10:19 发布

原创最新推荐文章于 2022-02-09 22:10:19 发布 · 566 阅读

0 ·

CC 4.0 BY-SA版权

codeforces 同时被 2 个专栏收录

145 篇文章

订阅专栏

物理题

1 篇文章

订阅专栏

探讨在伯兰德首都与奥运城市Bercouver间道路上，如何通过优化驾驶速度以最小化行驶时间的问题。考虑车辆加速、减速特性及限速标志的影响。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

【题目描述】
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 v km/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.

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

【输出】
Print the answer with at least five digits after the decimal point.

【样例输入】
1 1
2 1 3

【样例输出】
2.500000000000

【样例输入】
5 70
200 170 40

【样例输出】
8.965874696353

题目链接：https://codeforces.com/contest/5/problem/D

代码如下：

#include <bits/stdc++.h>
using namespace std;
int main()
{
    double a,v,l,d,w;
    cin>>a>>v>>l>>d>>w;
    double x=v*v/2/a;
    if(v<=w)
    {
        if(l<=x)
            cout<<fixed<<setprecision(6)<<sqrt(2*l/a)<<endl;
        else
            cout<<fixed<<setprecision(6)<<v/a+(l-x)/v<<endl;
    }
    else
    {
        if(d<=x+(v*v-w*w)/2/a)
        {
            if(sqrt(2*a*d)<=w)
            {
                if(l<=x)
                    cout<<fixed<<setprecision(6)<<sqrt(2*l/a)<<endl;
                else
                    cout<<fixed<<setprecision(6)<<v/a+(l-x)/v<<endl;
            }
            else
            {
                double t1=2*sqrt(w*w/2/a/a+d/a)-w/a;
                x=(v*v-w*w)/a/2;
                if(l-d<=x)
                    cout<<fixed<<setprecision(6)<<t1+(-w+sqrt(w*w+2*a*(l-d)))/a<<endl;
                else
                    cout<<fixed<<setprecision(6)<<t1+(v-w)/a+(l-d-x)/v<<endl;                
            }
        }
        else
        {
            double t1=v/a+(d-x-(v*v-w*w)/2/a)/v+(v-w)/a;
            x=(v*v-w*w)/a/2;
            if(l-d<=x)
                cout<<fixed<<setprecision(6)<<t1+(sqrt(w*w+2*a*(l-d))-w)/a<<endl;
            else
                cout<<fixed<<setprecision(6)<<t1+(v-w)/a+(l-d-x)/v<<endl;
        }
    }
    return 0;
}