제출 #471638

#제출 시각아이디문제언어결과실행 시간메모리
471638dqkRabbit Carrot (LMIO19_triusis)C++17
0 / 100
1 ms204 KiB
#include <bits/stdc++.h>
using i64 = long long;

int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int n, m;
    std::cin >> n >> m;
    std::vector<i64> a(n + 1, 0);
    for (int i = 1; i <= n; ++i) {
        std::cin >> a[i];
    }
    std::vector<bool> ok(n + 1, true);
    ok[0] = false;
    int ans = 0;
    for (int i = 1; i <= n; ++i) {
        if (a[i - 1] + 1ll * m < a[i]) {
            ans++;
            if (!ok[i - 1]) {
                a[i] = a[i - 1] + 1ll * m;
                ok[i] = false;
            }
        }
    }
    std::cout << ans << "\n";
    return 0;
}

#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...