Submission #1267335

#	Time	Username	Problem	Language	Result	Execution time	Memory
1267335		vpinx	Rabbit Carrot (LMIO19_triusis)	C++20	0 / 100	1 ms	328 KiB

triusis

#include <bits/stdc++.h>
using namespace std;
#define int long long

int solve() {
    int n, m;
    cin >> n >> m;
    
    vector<int> v(n + 1);
    for (int i = 1; i <= n; i++) cin >> v[i];
    v[0] = 0;
    
    int ans = 0;
    for (int i = 1; i <= n; i++) {
        if (v[i - 1] + m >= v[i]) continue;
        if (i == 1) v[i] = v[i - 1] + m, ans++;
        else if (v[i - 2] + (2 * m) < v[i]) v[i] = v[i - 1] + m, ans++;
        else v[i - 1] = v[i - 2] + m, ans++;
    }
    return ans;
}

int32_t main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    cout << solve();
    return 0;
}

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