A10419 | Vanya and Food Processor
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
Vanya smashes potato in a vertical food processor. At each moment of time the height of the potato in the processor doesn't exceed $h$ and the processor smashes $k$ centimeters of potato each second. If there are less than $k$ centimeters remaining, than during this second processor smashes all the remaining potato.
Vanya has $n$ pieces of potato, the height of the $i$ -th piece is equal to $a_{i}$ . He puts them in the food processor one by one starting from the piece number $1$ and finishing with piece number $n$ . Formally, each second the following happens:
1. If there is at least one piece of potato remaining, Vanya puts them in the processor one by one, until there is not enough space for the next piece.
2. Processor smashes $k$ centimeters of potato (or just everything that is inside).
Provided the information about the parameter of the food processor and the size of each potato in a row, compute how long will it take for all the potato to become smashed.
Vanya has $n$ pieces of potato, the height of the $i$ -th piece is equal to $a_{i}$ . He puts them in the food processor one by one starting from the piece number $1$ and finishing with piece number $n$ . Formally, each second the following happens:
1. If there is at least one piece of potato remaining, Vanya puts them in the processor one by one, until there is not enough space for the next piece.
2. Processor smashes $k$ centimeters of potato (or just everything that is inside).
Provided the information about the parameter of the food processor and the size of each potato in a row, compute how long will it take for all the potato to become smashed.
输入格式
The first line of the input contains integers $n$ , $h$ and $k$ ( $1<=n<=100000,1<=k<=h<=10^{9}$ ) — the number of pieces of potato, the height of the food processor and the amount of potato being smashed each second, respectively.
The second line contains $n$ integers $a_{i}$ ( $1<=a_{i}<=h$ ) — the heights of the pieces.
The second line contains $n$ integers $a_{i}$ ( $1<=a_{i}<=h$ ) — the heights of the pieces.
输出格式
Print a single integer — the number of seconds required to smash all the potatoes following the process described in the problem statement.
输入输出样例
输入 #1
5 6 3 5 4 3 2 1
输出 #1
5
输入 #2
5 6 3 5 5 5 5 5
输出 #2
10
输入 #3
5 6 3 1 2 1 1 1
输出 #3
2
Consider the first sample.
1. First Vanya puts the piece of potato of height $5$ into processor. At the end of the second there is only amount of height $2$ remaining inside.
2. Now Vanya puts the piece of potato of height $4$ . At the end of the second there is amount of height $3$ remaining.
3. Vanya puts the piece of height $3$ inside and again there are only $3$ centimeters remaining at the end of this second.
4. Vanya finally puts the pieces of height $2$ and $1$ inside. At the end of the second the height of potato in the processor is equal to $3$ .
5. During this second processor finally smashes all the remaining potato and the process finishes.
In the second sample, Vanya puts the piece of height $5$ inside and waits for $2$ seconds while it is completely smashed. Then he repeats the same process for $4$ other pieces. The total time is equal to $2·5=10$ seconds.
In the third sample, Vanya simply puts all the potato inside the processor and waits $2$ seconds.
1. First Vanya puts the piece of potato of height $5$ into processor. At the end of the second there is only amount of height $2$ remaining inside.
2. Now Vanya puts the piece of potato of height $4$ . At the end of the second there is amount of height $3$ remaining.
3. Vanya puts the piece of height $3$ inside and again there are only $3$ centimeters remaining at the end of this second.
4. Vanya finally puts the pieces of height $2$ and $1$ inside. At the end of the second the height of potato in the processor is equal to $3$ .
5. During this second processor finally smashes all the remaining potato and the process finishes.
In the second sample, Vanya puts the piece of height $5$ inside and waits for $2$ seconds while it is completely smashed. Then he repeats the same process for $4$ other pieces. The total time is equal to $2·5=10$ seconds.
In the third sample, Vanya simply puts all the potato inside the processor and waits $2$ seconds.
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted