Codeforces 677B Vanya and Food Processor【模拟】

最新推荐文章于 2022-07-07 00:21:00 发布

mengxiang000000

最新推荐文章于 2022-07-07 00:21:00 发布

阅读量347

点赞数

分类专栏：模拟文章标签： Codeforces 677B

本文链接：https://blog.csdn.net/mengxiang000000/article/details/54773641

版权

模拟专栏收录该内容

75 篇文章 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:

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.
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.

Input

The first line of the input contains integers n, h and k (1 ≤ n ≤ 100 000, 1 ≤ k ≤ h ≤ 10⁹) — 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.

Output

Print a single integer — the number of seconds required to smash all the potatoes following the process described in the problem statement.

Examples

Input

5 6 3
5 4 3 2 1

Output

Input

5 6 3
5 5 5 5 5

Output

Input

5 6 3
1 2 1 1 1

Output

Note

Consider the first sample.

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.
Now Vanya puts the piece of potato of height 4. At the end of the second there is amount of height 3 remaining.
Vanya puts the piece of height 3 inside and again there are only 3 centimeters remaining at the end of this second.
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.
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.

题目大意：

一共有N个物品需要进行处理，每个物品的高度为ai，对应机器最多可以放置H高度的物品，每秒机器处理掉K高度的物品。

问整个过程最少需要多少秒就能完成。

思路：

1、对应处理好之前机器中剩余的余数量。

2、如果余数+ai>H，那么则先清空机器，再放置ai高度的物品进去，如果ai+余数<=H，那么直接丢进去处理即可。

Ac代码：

#include<stdio.h>
#include<string.h>
using namespace std;
#define ll __int64
int main()
{
    ll n,h,k;
    while(~scanf("%I64d%I64d%I64d",&n,&h,&k))
    {
        ll output=0;
        ll yu=0;
        for(int i=1;i<=n;i++)
        {
            int x;
            scanf("%d",&x);
            if(yu+x>h)
            {
                yu=0;
                output++;
                output+=x/k;
                yu=x%k;
            }
            else
            {
                output+=(x+yu)/k;
                yu=(x+yu)%k;
            }
        }
        if(yu>0)
        output++;
        printf("%I64d\n",output);
    }
}