제출 #115463

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
115463		Vlatko	Cipele (COCI18_cipele)	C++14	90 / 90	733 ms	12536 KiB

cipele

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;



int n, m;
map<int, pii> counts;
vector<int> A, B;
multiset<int> Bset;

bool possible(int limit) {
    multiset<int> s = Bset;
    for (int x : A) {
        // y <= x
        auto it = s.lower_bound(x - limit);
        if (it != s.end() && *it <= x) {
            s.erase(it);
        } else {
            // y > x
            it = s.lower_bound(x+1);
            if (it == s.end() || *it > x+limit) {
                return false;
            }
            s.erase(it);
        }
    }
    return true;
}

int main() {
    ios::sync_with_stdio(false); cin.tie(0);

    cin >> n >> m;
    A.resize(n);
    B.resize(m);
    for (int i = 0; i < n; ++i) {
        cin >> A[i];
    }
    for (int i = 0; i < m; ++i) {
        cin >> B[i];
    }

    if (n > m) {
        swap(n, m);
        swap(A, B);
    }
    sort(A.begin(), A.end());
    for (int i = 0; i < m; ++i) {
        Bset.insert(B[i]);
    }

    int lo = 0, hi = 1e9, mid, ans = 1e9;
    while (lo <= hi) {
        mid = (lo + hi) / 2;
        if (possible(mid)) {
            ans = mid;
            hi = mid-1;
        } else {
            lo = mid+1;
        }
    }

    cout << ans << '\n';

}

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