| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 920412 | sleepntsheep | Rabbit Carrot (LMIO19_triusis) | C++17 | 0 ms | 0 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 <iostream>
#include <fstream>
#include <iomanip>
#include <cmath>
#include <cassert>
#include <cstring>
#include <vector>
#include <algorithm>
#include <deque>
#include <set>
#include <utility>
#include <array>
#include <complex>
#include <ranges>
using namespace std;
#define ALL(x) begin(x), end(x)
#define ShinLena cin.tie(nullptr)->sync_with_stdio(false);
#define N 200005
int n, m, a[N];
int main()
{
ShinLena;
cin >> n >> m;
for (int i = 1; i <= n; ++i) cin >> a[i];
cout << *ranges::partition_point(ranges::iota_view(0, n), [&](int x){
int h = 0;
for (int i = 1; i <= n; ++i)
{
if (a[i] - h > m)
{
if (!x--) return 1;
h += m;
}
else h = a[i];
}
return 0;
});
}
