Submission #1200976

#TimeUsernameProblemLanguageResultExecution timeMemory
1200976samuelandrianoo_Rabbit Carrot (LMIO19_triusis)C++20
0 / 100
1 ms1936 KiB
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define pb push_back
const ll mod = 1000000007;

void fastio(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
}

int main(){
   fastio();
   ll n, m, arr[200005], cnt = 0;
   cin >> n >> m;
   for (ll i = 1; i <= n; i++){
    cin >> arr[i];
   }

   if (arr[1] > m){
    cnt++;
    arr[1] = m;
   }

   for (ll i = 2; i <= n - 1; i++){
    if (abs(arr[i - 1] - arr[i + 1]) <= m * 2 && ((arr[i + 1] - arr[i] > m) || (arr[i] - arr[i - 1] > m))){
        arr[i] = arr[i - 1] + m;
        cnt++;
    }
    else if ((abs(arr[i - 1] - arr[i + 1]) > m) && (arr[i] - arr[i - 1]) > m){
        arr[i] = arr[i - 1] + m;
        cnt++;
    }
   }

   if (arr[n] - arr[n - 1] > m) cnt++;
   cout << cnt << endl;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...