제출 #668732

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
668732		Mystic03	Cipele (COCI18_cipele)	C++17	90 / 90	48 ms	2908 KiB

cipele

#include <bits/stdc++.h>

using namespace std;

// Binary search for answer. An answer works if you greedily chose elements to
// be paired and that works. If an answer works, then all above will work too.

const int MAXNM = 1e5 + 3;

int n, m, l[MAXNM], r[MAXNM];


bool ok(int val) {
    int pt = 1;

    for (int i = 1; i <= n; i++) {
        if (abs(r[pt] - l[i]) <= val) pt++;
        if (pt == m + 1) return true;
    }

    return pt == m + 1;
}


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

    cin >> n >> m;

    if (n >= m) {
        for (int i = 0; i < n; i++) cin >> l[i];
        for (int i = 0; i < m; i++) cin >> r[i];
    }
    else {
        for (int i = 0; i < n; i++) cin >> r[i];
        for (int i = 0; i < m; i++) cin >> l[i];
        swap(n, m);
    }

    sort(l, l + n);
    sort(r, r + m);

    int lp = 0, rp = 1e9;

    while (lp < rp) {
        int mid = (lp + rp) >> 1;
        if (ok(mid)) rp = mid;
        else lp = mid + 1;
    }

    cout << lp << '\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