제출 #398124

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
398124		palilo	Cipele (COCI18_cipele)	C++17	54 / 90	49 ms	2892 KiB

cipele

#include <bits/stdc++.h>
using namespace std;

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
#ifdef home
    freopen("in", "r", stdin);
    freopen("out", "w", stdout);
#endif
    int n, m;
    cin >> n >> m;

    vector<int> l(n), r(m);
    for (auto& x : l) cin >> x;
    for (auto& x : r) cin >> x;

    sort(l.begin(), l.end());
    sort(r.begin(), r.end());

    if (n > m) swap(n, m), swap(l, r);

    constexpr int mn = 0, mx = int(1e9) - 1;
    auto ok = [&](int lim) {
        int ptr = 0;
        for (const auto& x : l) {
            while (ptr < m && r[ptr] + lim < x) ++ptr;
            if (x + lim < r[ptr]) return false;
            ++ptr;
        }
        return true;
    };

    int lo = mn, hi = mx;
    while (lo != hi) {
        int mid = (lo + hi) >> 1;
        ok(mid) ? hi = mid : lo = mid + 1;
    }
    cout << lo;
}

• Subtask 1: 9 / 9
• Subtask 2: 0 / 9
• Subtask 3: 9 / 9
• Subtask 4: 9 / 9
• Subtask 5: 0 / 9
• Subtask 6: 9 / 9
• Subtask 7: 9 / 9
• Subtask 8: 9 / 9
• Subtask 9: 0 / 9
• Subtask 10: 0 / 9