Submission #1284325

#	Time	Username	Problem	Language	Result	Execution time	Memory
1284325		zxzuam	Rabbit Carrot (LMIO19_triusis)	C++20	0 / 100	2 ms	584 KiB

triusis

#include <bits/stdc++.h>
#define int long long
using ll = int64_t;
using namespace std;
constexpr int maxn = 1E5 + 1;
void orz() {
    int N, K;
    cin >> N >> K;
    vector <int> A(N + 1);
    for(int i = 1; i <= N; i++) {
        cin >> A[i];
    }
    int ans = 0;
    if(A[1] > K) {
        A[1] = K;
        ans++;
    }
    for(int i = 2; i <= N; i++) {
        if(A[i] > A[i - 1] + K) {
            if(A[i - 2] + (2 * K) < A[i]) {
                A[i] = A[i - 1] + K;
            }
            else{
                A[i - 1] = A[i] - K;
            }
            ans++;
        }
    }
    cout << ans;
}
int32_t main() {
    ios_base::sync_with_stdio(false), cin.tie(nullptr);
    //freopen("promote.in", "r", stdin);
    //freopen("promote.out", "w", stdout);
    int T = 1;
    //cin >> T;
    while(T--) orz();
    return 0;
}

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