Submission #997434

#	Time	Username	Problem	Language	Result	Execution time	Memory
997434		crafticat	Measures (CEOI22_measures)	C++17	0 / 100	1533 ms	592 KiB

Main

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

constexpr ll inf = 1e9;
constexpr ll epsilon = 1;
ll d;

bool ok(vector<ll> &arr, ll move) {
    ll lastPos = -inf;
    for (auto x : arr) {
        ll req = (lastPos + d) - x;
        req = max(req, -move);
        if (req > move) return false;
        lastPos = x + req;
    }
    return true;
}

double solve(vector<ll> arr) {
    std::sort(arr.begin(), arr.end());

    ll l = 0, r = inf;
    while (r - l > 0) {
        ll mid = l + (r - l) / 2;
        if (ok(arr,mid)) {
            r = mid;
        } else {
            l = mid + epsilon;
        }
    }
    return l;
}

int main() {
    ll n, m; cin >> n >> m >> d;

    vector<ll> p;
    for (ll i = 0; i < n; ++i) {
        ll x; cin >> x;
        x *= 10;
        p.push_back(x);
    }

    d*=10;

    for (ll i = 0; i < m; ++i) {
        ll x; cin >> x;
        x *= 10;
        p.push_back(x);
        ll ans = solve(p);
        cout << ans / 10;
        ans %= 10;
        if (ans != 0) cout << ".";
        while (ans != 0) {
            cout << ans;
            ans /= 10;
        }
        cout << "\n";
    }

    return 0;
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 14
• Subtask 3: 0 / 35
• Subtask 4: 0 / 41