Vanya and Food Processor
2016-07-31 23:58
357 查看
Description
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 ai.
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 ≤ 109) —
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 ai (1 ≤ ai ≤ 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.
Sample Input
Input
Output
Input
Output
Input
Output
Hint
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.
#include<stdio.h>
#include<string.h>
#include<iostream>
using namespace std;
int main()
{
int n,m,k;
__int64 ans=0;
scanf("%d%d%d",&n,&m,&k);
int x,now=0;
for(int i=0;i<n;i++)
{
scanf("%d",&x);
if(x+now>m)
{
ans++;
now=0;
}
now=now+x;
ans=ans+now/k;
now=now%k;
}
if(now)ans++;
printf("%I64d\n",ans);
return 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 ai.
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 ≤ 109) —
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 ai (1 ≤ ai ≤ 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.
Sample Input
Input
5 6 3 5 4 3 2 1
Output
5
Input
5 6 3
5 5 5 5 5
Output
10
Input
5 6 3 1 2 1 1 1
Output
2
Hint
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.
#include<stdio.h>
#include<string.h>
#include<iostream>
using namespace std;
int main()
{
int n,m,k;
__int64 ans=0;
scanf("%d%d%d",&n,&m,&k);
int x,now=0;
for(int i=0;i<n;i++)
{
scanf("%d",&x);
if(x+now>m)
{
ans++;
now=0;
}
now=now+x;
ans=ans+now/k;
now=now%k;
}
if(now)ans++;
printf("%I64d\n",ans);
return 0;
}
相关文章推荐
- Codeforces Round #355 (Div. 2) B. Vanya and Food Processor
- [Codeforces677B]Vanya and Food Processor(模拟,数学)
- Codeforces Round #355 (Div. 2)-B. Vanya and Food Processor,纯考思路~~
- B. Vanya and Food Processor
- ★【16.6.2】Codeforces Round #355 (Div. 2) B. Vanya and Food Processor
- Codeforces Round #355 (Div. 2) B. Vanya and Food Processor 水题
- Codeforces Round #355 (Div. 2) B. Vanya and Food Processor(贪心)
- codeforces 677 B Vanya and Food Processor (模拟)
- codeforces 677B B. Vanya and Food Processor(模拟)
- Codeforces Round #355 (Div. 2) B. Vanya and Food Processor (模拟)
- 暑假练习赛 006 A Vanya and Food Processor(模拟)
- Codeforces Round #355 (Div. 2)-B. Vanya and Food Processor(模拟)
- CodeForces 552C:Vanya and Scales【技巧】
- #308 (div.2) B. Vanya and Books
- Codeforces 492D - Vanya and Computer Game (二分)
- Codeforces Round #355 (Div. 2) A. Vanya and Fence(水题)
- Codeforces Round #280 (Div. 2) E. Vanya and Field 数学
- Codeforces 552E - Vanya and Brackets【表达式求值】
- CodeForces 552 D.Vanya and Triangles(组合数学)
- D. Vanya and Triangles(Codeforces Round #308 (Div. 2))