| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1229092 | tutientd | Rabbit Carrot (LMIO19_triusis) | C++20 | 2 ms | 328 KiB |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n + 1);
a[0] = 0;
for (int i = 1; i <= n; ++i) cin >> a[i];
int res = 0;
for (int i = 1; i <= n; ++i) {
if (a[i] - a[i - 1] > m) {
res++;
a[i] = a[i - 1] + m;
}
}
cout << res;
}| # | 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... | ||||
