A11214 | Bus
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
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.
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.
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.
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$ .
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.
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.
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$ .
输入格式
The first line contains four integers $a$ , $b$ , $f$ , $k$ ( $0<f<a<=10^{6}$ , $1<=b<=10^{9}$ , $1<=k<=10^{4}$ ) — 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.
输出格式
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.
输入输出样例
输入 #1
6 9 2 4
输出 #1
4
输入 #2
6 10 2 4
输出 #2
2
输入 #3
6 5 4 3
输出 #3
-1
In the first example the bus needs to refuel during each journey.
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.
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.
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.
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.
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted