codeforces 677 B Vanya and Food Processor (模拟)
2016-06-02 09:27
295 查看
[align=center]codeforces #355 B(Div 2)http://http://codeforces.com/contest/677/problem/B[/align]
[align=center]B. Vanya and Food Processor[/align]
[align=center]time limit per test[/align]
[align=center]1 second[/align]
[align=center]memory limit per test[/align]
[align=center]256 megabytes[/align]
[align=center]input[/align]
[align=center]standard input[/align]
[align=center]output[/align]
[align=center]standard output[/align]
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.
Examples
Input
Output
Input
Output
Input
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.
解题思路:直接模拟,注意要使用取模,不要直接-,会TLE。这道题比赛的时候居然调了那么久....最可怕的是因为没有存为long long,结果最后居然挂了.....感觉自己被套路了T^T
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int a[100005];
//bool vis[100005];
int main()
{
//freopen("test.txt","r",stdin);
int n,k,h,now = 0;
ll ans = 0;
int i;
cin>>n>>h>>k;
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
/*for(i=0;i<n;i++)
{
if(a[i]>=h && now==0)
{
now += a[i];
}
else if(now+a[i]<=h)
{
now += a[i];
}
else
{
if(now>=k)
{
now -= k;
}
else
now = 0;
ans++;
i--;
}
}*/
i = 0;
while(1)
{
if(i==n && now==0)
break;
if(a[i]>=h && now==0 && i<n)
{
now += a[i];
i++;
}
else if(now + a[i] <= h && i<n)
{
now += a[i];
i++;
}
else
{
if(now>=k)
{
ans += int(now/k);
now = now%k;
}
else
{
now = 0;
ans++;
}
}
}
cout << ans << endl;
return 0;
}
[align=center]B. Vanya and Food Processor[/align]
[align=center]time limit per test[/align]
[align=center]1 second[/align]
[align=center]memory limit per test[/align]
[align=center]256 megabytes[/align]
[align=center]input[/align]
[align=center]standard input[/align]
[align=center]output[/align]
[align=center]standard output[/align]
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.
Examples
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
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.
解题思路:直接模拟,注意要使用取模,不要直接-,会TLE。这道题比赛的时候居然调了那么久....最可怕的是因为没有存为long long,结果最后居然挂了.....感觉自己被套路了T^T
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int a[100005];
//bool vis[100005];
int main()
{
//freopen("test.txt","r",stdin);
int n,k,h,now = 0;
ll ans = 0;
int i;
cin>>n>>h>>k;
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
/*for(i=0;i<n;i++)
{
if(a[i]>=h && now==0)
{
now += a[i];
}
else if(now+a[i]<=h)
{
now += a[i];
}
else
{
if(now>=k)
{
now -= k;
}
else
now = 0;
ans++;
i--;
}
}*/
i = 0;
while(1)
{
if(i==n && now==0)
break;
if(a[i]>=h && now==0 && i<n)
{
now += a[i];
i++;
}
else if(now + a[i] <= h && i<n)
{
now += a[i];
i++;
}
else
{
if(now>=k)
{
ans += int(now/k);
now = now%k;
}
else
{
now = 0;
ans++;
}
}
}
cout << ans << endl;
return 0;
}
相关文章推荐
- 如何理解闭包?
- Android开发之基本控件和详解四种布局方式
- 母函数(转)
- wkwebView的 学习
- 第十二周上机实践项目 项目1-实现复数类中的运算符重载 (2)
- Ubuntu 16 下载、编译Nexus 6 Android6.0源码记录
- linux学习点滴(一步步总结,常用命令)
- 跑步与读书都废掉了...工作目前也在换新的.
- 第二冲刺阶段 工作总结 10
- mvc框架
- 白话开发——Android Studio代码调试技巧篇
- oracle学习(六)--时间日期函数
- poj1013 Counterfeit Dollar
- WPF checkbox绑定和通过值更新将存入的 1-0 转换成 true false
- Android Studio详细教程汇总
- hello
- 第13周阅读程序(3)
- Linux的SSH登录超时自动断开连接设置
- Android中apk加固完善篇之内存加载dex方案实现原理(不落地方式加载)
- spring mvc + spring + mybatis 框架搭建 遇到的一些问题及解决方案