Submission #1229783

#TimeUsernameProblemLanguageResultExecution timeMemory
1229783ming2900Rabbit Carrot (LMIO19_triusis)C++20
0 / 100
1 ms328 KiB
#include <iostream>
#include <vector>

using namespace std;

int main() {
    int N, M;
    cin >> N >> M;

    vector<int> a(N);
    for (int i = 0; i < N; ++i)
        cin >> a[i];

    int count = 0;
    int height = 0;

    for (int i = 0; i < N; ++i) {
        if (a[i] - height > M) {
            ++count;
            height = height + M;
        } else {
            height = a[i];
        }
    }

    cout << count << endl;
    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...