Submission #1278074

#	Time	Username	Problem	Language	Result	Execution time	Memory
1278074		nuruyeva	Rabbit Carrot (LMIO19_triusis)	C++17	0 / 100	3 ms	588 KiB

triusis

#include <iostream>
#include <string>
#include <cmath>
#include <vector>
#include <stack>
#include <set>
#include <array>
#include <deque>
#include <queue>
#include <cstdio>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <utility>
#include <climits>
#include <iomanip>
#define ll long long
#define endl '\n'
#define fast ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
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 prev = 0;  
    for(int i = 0; i < N; i++) {
        if(a[i] > prev + M) {
            count++;     
            prev = prev + M; 
        } 
        else {
            prev = a[i]; 
        }
    }

    cout << count << endl;
    return 0;
}

• Subtask 1: 0 / 14
• Subtask 2: 0 / 21
• Subtask 3: 0 / 28
• Subtask 4: 0 / 37