Submission #578686

#	Time	Username	Problem	Language	Result	Execution time	Memory
578686		shubham20_03	Rabbit Carrot (LMIO19_triusis)	C++17	0 / 100	1 ms	320 KiB

triusis

#include <bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL);
#define deb(x) cout<<#x<<'='<<x<<'\n';
#define deb2(x,y) cout<<#x<<'='<<x<<", "<<#y<<'='<<y<<'\n';
#define int long long
#define all(x) (x).begin(), (x).end()
#define pii pair<int, int>
#define pb push_back
#define f first
#define s second
#define sz(x) (int)(x).size()
const long double PI = acos(-1);
const int mod = 1e9 + 7, inf = 1e18;
const int D = 2e5 + 10;

signed main() {
    fastio

    //freopen("../input1.txt", "r", stdin);
    //freopen("../output1.txt", "w", stdout);

    int n, m; cin >> n >> m;
    int a[n + 5] = {0};
    for (int i = 1; i <= n; i++)
        cin >> a[i];

    int ans = 0;
    for (int i = 0; i < n; i++) {
        if (a[i + 1] - a[i] > m)
            ans++;
        a[i + 1] = min(a[i + 1], a[i] + m);
    }
    cout << ans << '\n';

    return 0;
}

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