Submission #1054013

#TimeUsernameProblemLanguageResultExecution timeMemory
1054013aun5xRabbit Carrot (LMIO19_triusis)C++14
0 / 100
0 ms348 KiB
#include <bits/stdc++.h>
using namespace std;

int main (){
    long long n, m;
    cin >> n >> m;
    long long height = 0;
    int i = 0;
    // first pass
    int ans = 0;
    for (; i < n; i++){
        long long h; cin >> h;
        // we decrease h till h - height = m
        // so we jump up to h, h should equal height + m;
        if (h - height > m){
            ans++;
            height = height + m;
        } 
        // Otherwise we dont do anything
        else{
            i++;
            height = h;
            break;
        }
    }
    // second pass now we can choose to increase 
    for (; i < n; i++){
        long long h; cin >> h;
        // increase h to height 
        if (h - height > m){
            ans++; 
        }
        height = h;
    }
    cout << ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...