B. Vanya and Food Processor
来源:互联网 发布:开源淘宝客 导入 编辑:程序博客网 时间:2024/04/27 20:54
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 kcentimeters 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.
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.
Print a single integer — the number of seconds required to smash all the potatoes following the process described in the problem statement.
5 6 35 4 3 2 1
5
5 6 35 5 5 5 5
10
5 6 31 2 1 1 1
2
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<cstdio>#include <cstring>#include<cmath>#include<iostream>#include<algorithm>#include<vector>#include <map>using namespace std;int main(){long long n, h, k, i, a, cur, sec;scanf("%lld %lld %lld", &n, &h, &k);cur = sec = 0;for (i = 0; i < n; ++i){scanf("%lld", &a);if (cur + a <= h) {cur += a;}else{cur = a;++sec;}sec += cur / k;cur %= k;}sec += cur / k;cur %= k;if (cur > 0){++sec;}printf("%lld\n", sec);}
- B. Vanya and Food Processor
- CodeForces 677B Vanya and Food Processor
- Vanya and Food Processor
- codeforces 677 B Vanya and Food Processor (模拟)
- Codeforces Round #355 (Div. 2) B. Vanya and Food Processor
- codeforces 677B Vanya and Food Processor(模拟)
- Codeforces 677B Vanya and Food Processor【模拟】
- Codeforces 677B Vanya and Food Processor (模拟的好题)
- Codeforces Round #355 (Div. 2)-B. Vanya and Food Processor,纯考思路~~
- Codeforces Round #355 (Div. 2) 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 677B Vanya and Food Processor(打土豆,模拟)
- Codeforces Round #355 (Div. 2) B. Vanya and Food Processor (模拟)
- B. Vanya and Lanterns
- B - Vanya and Lanterns
- B - Vanya and Lanterns
- B. Vanya and Books
- jdbc连接数据库使用sid和service_name的区别
- 技巧: 使用truss、strace或ltrace诊断软件的"疑难杂症"
- ReactiveCocoa框架菜鸟入门(四)——信号(Signal)详解
- 系统运行日志基础数据分析
- 利用JAXB实现xml和bean之间的转换(一)
- B. Vanya and Food Processor
- ssh 免密码登陆
- Think PHP(TP)框架的基本使用 (二)
- 反编译
- 开发异常问题总结一
- 独家分享——大牛教你如何学习Web前端开发
- 开源项目工具库篇
- JSP--基本知识
- 理论