oj.uz

Submission #471632

# Submission time Handle Problem Language Result Execution time Memory
471632 2021-09-10T04:48:54 Z dqk Rabbit Carrot (LMIO19_triusis) C++17
0 / 100
 1 ms 468 KB 
#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] - a[i - 1] > m) {
            ans++;
            if (!ok[i - 1]) {
                a[i] = a[i - 1] + m;
                ok[i] = false;
            }
            else {
                a[i - 1] = a[i] - m;
            }
        }
    }
    for (int i = 1; i <= n; ++i) {
        assert(a[i] - a[i - 1] <= m);
    }
    std::cout << ans << "\n";
    return 0;
}

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 272 KB Output is correct
4 Runtime error 1 ms 468 KB Execution killed with signal 6
5 Halted 0 ms 0 KB -

Subtask #2
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 272 KB Output is correct
4 Runtime error 1 ms 468 KB Execution killed with signal 6
5 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 272 KB Output is correct
4 Runtime error 1 ms 468 KB Execution killed with signal 6
5 Halted 0 ms 0 KB -

Subtask #4
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 272 KB Output is correct
4 Runtime error 1 ms 468 KB Execution killed with signal 6
5 Halted 0 ms 0 KB -