codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

29B.md (1685B)


      1 Source: https://codeforces.com/problemset/problem/29/B
      2 
      3 B. Traffic Lights
      4 
      5 time limit per test
      6 
      7 2 seconds
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 stdin
     16 
     17 output
     18 
     19 stdout
     20 
     21 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.
     22 
     23 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.
     24 
     25 What is the minimum time for the car to get from point A to point B without breaking the traffic rules?
     26 
     27 Input
     28 
     29 The first line contains integers *l*, *d*, *v*, *g*, *r* (1 ≤ *l*, *d*, *v*, *g*, *r* ≤ 1000, *d* < *l*) — the distance between A and B (in meters), the distance from A to the traffic lights, car's speed, the duration of green light and the duration of red light.
     30 
     31 Output
     32 
     33 Output a single number — the minimum time that the car needs to get from point A to point B. Your output must have relative or absolute error less than 10- 6.
     34 
     35 Examples
     36 
     37 Input
     38 
     39 ```
     40 2 1 3 4 5
     41 ```
     42 
     43 Output
     44 
     45 ```
     46 0.66666667
     47 ```
     48 
     49 Input
     50 
     51 ```
     52 5 4 3 1 1
     53 ```
     54 
     55 Output
     56 
     57 ```
     58 2.33333333
     59 ```