zoukankan      html  css  js  c++  java
  • Traffic Lights

    Traffic Lights
    time limit per test
    2 seconds
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    A car moves from point A to point B at speed v meters per second. The action takes place on the X-axis. At the distance d meters from A there are traffic lights. Starting from time 0, for the first g seconds the green light is on, then for the following r seconds the red light is on, then again the green light is on for the g seconds, and so on.

    The car can be instantly accelerated from 0 to v and vice versa, can instantly slow down from the v to 0. Consider that it passes the traffic lights at the green light instantly. If the car approaches the traffic lights at the moment when the red light has just turned on, it doesn't have time to pass it. But if it approaches the traffic lights at the moment when the green light has just turned on, it can move. The car leaves point A at the time 0.

    What is the minimum time for the car to get from point A to point B without breaking the traffic rules?

    提示:

    1.注意“If the car approaches the traffic lights at the moment when the red light has just turned on, it doesn't have time to pass it”。

    2.只要不是等待绿灯,都全速行驶

    AC  Code:

     1 #include <iostream>
     2 #include <string>
     3 #include <algorithm>
     4 #include <map>
     5 #include <vector>
     6 #include <cstdio>
     7 #include <cmath>
     8 #include <cstring>
     9 using namespace std;
    10 
    11 int main()
    12 {
    13     double l, d, v, g, r;
    14     double ans;
    15     const double eps = 1e-8;
    16     while(cin >> l >> d >> v >> g >> r)
    17     {
    18         int t = d / v / (g + r);
    19         double a = d / v -  t * (g + r);
    20         if(fabs(a - g) < eps)
    21             ans = l / v + r;
    22         else if(a < g)
    23             ans = l / v;
    24         else
    25             ans = g + r - a + l / v;
    26         printf("%.8lf
    ", ans);
    27     }
    28     return 0;
    29 }
  • 相关阅读:
    布隆过滤器
    springboot+redis实现分布式锁
    springboot+redis实现消息队列
    工作启示文章收藏
    redis常用命令
    前方的路
    分布式系统中对cookie和session的思考
    用Markdown来写自由书籍-开源技术的方案
    Centos 7.0添加yum本地安装源
    爹地,我找到了!15个极好的Linux find命令示例
  • 原文地址:https://www.cnblogs.com/cszlg/p/3246548.html
Copyright © 2011-2022 走看看