Submission #1299709

#	Time	Username	Problem	Language	Result	Execution time	Memory
1299709		bethance	Rabbit Carrot (LMIO19_triusis)	C++20	0 / 100	2 ms	580 KiB

triusis

#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,k;
	cin>>n>>k;
	vector<int> poles(n);
	for(int i=0;i<n;i++){
		cin>>poles[i];
	}
	int ans=0;
	if(poles[0]>k){
		ans++;
		poles[0]=k;
	}
	for(int i=1;i<n;i++){
		if(poles[i]-poles[i-1]>k){
			ans++;
			poles[i]=poles[i-1]+k;
		}
	}
	cout<<ans<<endl;
}

• Subtask 1: 0 / 14
• Subtask 2: 0 / 21
• Subtask 3: 0 / 28
• Subtask 4: 0 / 37