| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 659223 | dubabuba | Rabbit Carrot (LMIO19_triusis) | C++14 | 0 ms | 212 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
int a[n+1]; a[0] = 0;
for(int i = 1; i <= n; i++)
cin >> a[i];
vector<int> v;
v.push_back(0);
for(int i = 1; i <= n; i++) {
int id = v[v.size() - 1];
if(a[i] - a[id] <= d)
v.push_back(i);
}
cout << n - v.size() + 1 << '\n';
return 0;
}| # | 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... | ||||
