Submission #920413

#	Time	Username	Problem	Language	Result	Execution time	Memory
920413		sleepntsheep	Rabbit Carrot (LMIO19_triusis)	C++17	0 / 100	1 ms	348 KiB

triusis

#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];
    auto bad = [&](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;
        };

    int l = 0, r = n;
    while (l <= r)
    {
        int m = (l+r)/2;
        if (bad(m)) l = m + 1;
        else r = m - 1;
    }

    cout << r + 1;
}

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