Submission #987780

#TimeUsernameProblemLanguageResultExecution timeMemory
987780VMaksimoski008Paprike (COI18_paprike)C++17
13 / 100
34 ms2132 KiB
#include <bits/stdc++.h>

#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
//#define int long long

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;

int32_t main() {
    int n;
    ll k;
    cin >> n >> k;

    vector<ll> val(n+1);
    for(int i=1; i<=n; i++) cin >> val[i];

    ll sum=0, ans=0;

    for(int i=1; i<=n; i++) {
        if(sum + val[i] > k) {
            ans++;
            sum = val[i];
        } else sum += val[i];
    }

    cout << ans << '\n';
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...