oj.uz

Submission #525220

# Submission time Handle Problem Language Result Execution time Memory
525220 2022-02-11T06:28:53 Z IMystic Rabbit Carrot (LMIO19_triusis) C++17
0 / 100
 1 ms 204 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1000000010;


int main(){
    ios_base :: sync_with_stdio(false);
    cin.tie(nullptr);

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

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 1 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 1 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 1 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 1 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -