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 ofv 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.

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 numbersld and w (2 ≤ l ≤ 100001 ≤ d < l1 ≤ w ≤ 10000).

Output

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

Sample test(s)
input
1 1
2 1 3
output
2.500000000000
input
5 70
200 170 40
output
8.965874696353

代码:

#include <stdio.h>
#include <math.h>

int main()
{
#ifdef _LOCAL
    freopen("F://input.txt", "r", stdin);
#endif
  double a, v, l, d, w;
  scanf("%lf%lf%lf%lf%lf", &a, &v, &l, &d, &w);
  if(v <= w || w * w / (2 * a) >= d)
  {
      double t = v / a;
      double len = a * t * t / 2;
      if(len > l)
          printf("%lf", sqrt(2 * l / a));
      else if(len == l)
          printf("%lf", t);
      else
          printf("%lf", t + (l - len) / v);
  }
  else
  {
      double total = 0;
      double t =  w / a;
      double len = a * t * t / 2;
      total += t;
      double len1 = d - len;//在达到限速后可以先加速后减速(或者加速 匀速, 减速), 恰好在达到限速点时以w通过
      double t1 = (v - w) / a;
      if((w + v) * t1 <= len1)
          total += 2 * t1 + (len1 - (w + v) * t1) / v;
      else
          total += 2 *(sqrt( w * w + a * len1)- w) / a;
      double t2 = (v - w) / a;
      double len2 = w * t2 +  a * t2 * t2 / 2;
      double len3 = l - d;
      if(len2 > len3)
          total += (sqrt(w * w + 2 * a * len3) - w) / a;
      else 
          total += t2 + (len3 - len2) / v;
      printf("%.10lf", total);
  }
  return 0;
}



  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值