codeforces-scrape

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

864C.md (2943B)


      1 Source: https://codeforces.com/problemset/problem/864/C
      2 
      3 C. Bus
      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 standard input
     16 
     17 output
     18 
     19 standard output
     20 
     21 A bus moves along the coordinate line *Ox* from the point *x* = 0 to the point *x* = *a*. After starting from the point *x* = 0, it reaches the point *x* = *a*, immediately turns back and then moves to the point *x* = 0. After returning to the point *x* = 0 it immediately goes back to the point *x* = *a* and so on. Thus, the bus moves from *x* = 0 to *x* = *a* and back. Moving from the point *x* = 0 to *x* = *a* or from the point *x* = *a* to *x* = 0 is called a bus journey. In total, the bus must make *k* journeys.
     22 
     23 The petrol tank of the bus can hold *b* liters of gasoline. To pass a single unit of distance the bus needs to spend exactly one liter of gasoline. The bus starts its first journey with a full petrol tank.
     24 
     25 There is a gas station in point *x* = *f*. This point is between points *x* = 0 and *x* = *a*. There are no other gas stations on the bus route. While passing by a gas station in either direction the bus can stop and completely refuel its tank. Thus, after stopping to refuel the tank will contain *b* liters of gasoline.
     26 
     27 What is the minimum number of times the bus needs to refuel at the point *x* = *f* to make *k* journeys? The first journey starts in the point *x* = 0.
     28 
     29 Input
     30 
     31 The first line contains four integers *a*, *b*, *f*, *k* (0 < *f* < *a* ≤ 106, 1 ≤ *b* ≤ 109, 1 ≤ *k* ≤ 104) — the endpoint of the first bus journey, the capacity of the fuel tank of the bus, the point where the gas station is located, and the required number of journeys.
     32 
     33 Output
     34 
     35 Print the minimum number of times the bus needs to refuel to make *k* journeys. If it is impossible for the bus to make *k* journeys, print -1.
     36 
     37 Examples
     38 
     39 Input
     40 
     41 ```
     42 6 9 2 4
     43 ```
     44 
     45 Output
     46 
     47 ```
     48 4
     49 ```
     50 
     51 Input
     52 
     53 ```
     54 6 10 2 4
     55 ```
     56 
     57 Output
     58 
     59 ```
     60 2
     61 ```
     62 
     63 Input
     64 
     65 ```
     66 6 5 4 3
     67 ```
     68 
     69 Output
     70 
     71 ```
     72 -1
     73 ```
     74 
     75 Note
     76 
     77 In the first example the bus needs to refuel during each journey.
     78 
     79 In the second example the bus can pass 10 units of distance without refueling. So the bus makes the whole first journey, passes 4 units of the distance of the second journey and arrives at the point with the gas station. Then it can refuel its tank, finish the second journey and pass 2 units of distance from the third journey. In this case, it will again arrive at the point with the gas station. Further, he can refill the tank up to 10 liters to finish the third journey and ride all the way of the fourth journey. At the end of the journey the tank will be empty.
     80 
     81 In the third example the bus can not make all 3 journeys because if it refuels during the second journey, the tanks will contain only 5 liters of gasoline, but the bus needs to pass 8 units of distance until next refueling.