Submission #1130187

#TimeUsernameProblemLanguageResultExecution timeMemory
1130187NurislamRabbit Carrot (LMIO19_triusis)C++17
0 / 100
1 ms328 KiB
#include <bits/stdc++.h>
using namespace std;

#define int long long
//#define all(x) x.begin(),x.end()
//#define rall(x) x.rbegin(),x.rend()
//#define ff first
//#define ss second
//#define pb push_back
//template<class T, class U> inline bool chmin(T& a, const U& b) { if (a > b) { a = b; return true; } return false; }
//template<class T, class U> inline bool chmax(T& a, const U& b) { if (a < b) { a = b; return true; } return false; }
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
//#define rnd(l, r) uniform_int_distribution <int> (l, r)(rng)

//const int inf  = 1e18, mod = 1e9+7;

void solve(){
	int n, m;
	cin >> n >> m;
	int l = 0, ans = 0;
	bool cant = 1;
	for(int i = 0; i < n; i++){
		int x;
		cin >> x;
		if(l+m < x){
			if(cant){
				l = l+m;
			}else l = x;
			ans++;
		}else{
			l = x;
			cant = 0;
		}
	}
	cout << ans << '\n';
};

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);
    int tt = 1;
    //cin >> tt;
    while(tt--){
        solve();
    };
}














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