# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1228760 | khoingu | Rabbit Carrot (LMIO19_triusis) | C++20 | 1 ms | 328 KiB |
#include <bits/stdc++.h>
#define ll long long
#define fi(i,a,b) for(int i = a; i <= b; i ++)
using namespace std;
const ll maxN = 2e5 + 5;
int n, m, a[maxN];
signed main() {
if (fopen("task.inp", "r")) {
freopen("task.inp", "r", stdin);
freopen("task.out", "w", stdout);
}
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n >> m;
for(int i = 1; i <= n; i ++) cin >> a[i];
int cnt = 0;
for(int i = 1; i <= n; i ++) {
if (i == 1) {
if (a[i] > m) {
a[i] = m;
cnt ++;
}
}
else if (a[i] > a[i - 1] + m) {
a[i] = a[i - 1] + m;
cnt ++;
}
}
cout << cnt;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |