Submission #1313332

#	Time	Username	Problem	Language	Result	Execution time	Memory
1313332		rojuslol1	Rabbit Carrot (LMIO19_triusis)	C++20	0 / 100	2 ms	332 KiB

triusis

#include <iostream>
#include <vector>

using namespace std;

int main() {
	long long n, jump; cin >> n >> jump;
	long long currh = 0, ats = 0;
	vector<long long> m(n);
	for (long long i = 0; i < n; i++) {
		cin >> m[i];
	}
	for (long long i = 0; i < n; i++) {
		if (currh + jump >= m[i]) currh = max(currh, m[i]);
		else {
			ats++;
			currh += jump;
		}
	}
	cout << ats << '\n';
}

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