제출 #1164640

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1164640		AbdullahIshfaq	Rabbit Carrot (LMIO19_triusis)	C++20	0 / 100	1 ms	328 KiB

triusis

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define MOD 998244353
void solve(){
	ll n, k;
	cin >> n >> k;
	vector<ll> h(n + 1);
	for(int i = 1;i <= n ; i++){
		cin >> h[i];
	}
	ll ans = 0, curr = 0;
	if(h[1] > k){
		h[1] = k;
		ans++;
	}
	curr = h[1];
	for(int i = 2;i <= n; i++){
		if(h[i] - curr > k){
			ans++;
			if(h[i] - h[i - 2] <= 2 * k){
				h[i - 1] = h[i - 2] + k;
			}
			else{
				h[i] = h[i - 1] + k;
			}
		}
		curr = h[i];
	}
	cout << ans << '\n';
}
int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	int tests = 1;
	// cin >> tests;
	for(int i = 1; i <= tests; i ++)
		solve();
}

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