| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1294075 | zahra_ | Paprike (COI18_paprike) | C++20 | 63 ms | 1196 KiB |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ll n , k;
cin >> n >> k;
vector<ll>h(n + 1);
for(int i = 1 ; i <= n ; i++){
cin >> h[i];
}
for(int i = 0 ; i < n - 1 ; i++){
ll x , y;
cin >> x >> y;
}
ll ans = 0;
ll sum = 0;
for(int i = 1 ; i <= n ; i++){
if(sum + h[i] <= k){
sum += h[i];
}else{
ans++;
sum = h[i];
}
}
cout << ans << endl;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
