-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathgarbageDisposal.cpp
54 lines (37 loc) · 1.16 KB
/
garbageDisposal.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
#include <iostream>
using namespace std;
/*
* http://codeforces.com/problemset/problem/1070/D
*/
long long todaysGarbage;
long long k; // units that a bag of garbage can carry
long long previousGarbage;
long long totalBagsNeeded; //answer
long long n; // days
int main(){
cin >> n >> k;
previousGarbage = 0;
totalBagsNeeded = 0;
long long temp;
for(int i =0; i <n; i++){
cin >> todaysGarbage;
if(previousGarbage % k != 0){
temp = ((previousGarbage/k)+1)*k - previousGarbage;
if(temp > todaysGarbage){
previousGarbage+=todaysGarbage;
todaysGarbage = 0;
}else{
todaysGarbage-=temp;
previousGarbage+=temp;
}
totalBagsNeeded+= (previousGarbage % k) == 0? previousGarbage / k : (previousGarbage/k)+1;
}else{
totalBagsNeeded+= previousGarbage/k;
}
previousGarbage = todaysGarbage % k;
totalBagsNeeded+=todaysGarbage/k;
}
totalBagsNeeded+= (previousGarbage % k) == 0 ? previousGarbage/k: (previousGarbage/k) +1;
cout << totalBagsNeeded << endl;
return 0;
}