Submission #990099

#	Time	Username	Problem	Language	Result	Execution time	Memory
990099		LOLOLO	Cipele (COCI18_cipele)	C++17	90 / 90	457 ms	7724 KiB

cipele

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
 
#define           f     first
#define           s     second
#define           pb    push_back
#define           ep    emplace
#define           eb    emplace_back
#define           lb    lower_bound
#define           ub    upper_bound
#define       all(x)    x.begin(), x.end()
#define      rall(x)    x.rbegin(), x.rend()
#define   uniquev(v)    sort(all(v)), (v).resize(unique(all(v)) - (v).begin())
#define     mem(f,x)    memset(f , x , sizeof(f))
#define        sz(x)    (ll)(x).size()
#define  __lcm(a, b)    (1ll * ((a) / __gcd((a), (b))) * (b))
#define          mxx    *max_element
#define          mnn    *min_element
#define    cntbit(x)    __builtin_popcountll(x)
#define       len(x)    (int)(x.length())
 
const int N = 1e5 + 10;
vector <int> a, b;

bool check(int val) {
    multiset <int> st;
    for (int i = 1; i < sz(b); i++)
        st.insert(b[i]);

    for (int i = 1; i < sz(a); i++) {
        int x = a[i];
        auto it = st.lower_bound(x - val);
        if (it == st.end() || abs(*it - x) > val) {
            return 0;
        }

        st.erase(st.find(*it));
    }

    return 1;
}

int solve() {
    int n, m;
    cin >> n >> m;

    a.resize(n + 1);
    b.resize(m + 1);

    for (int i = 1; i <= n; i++) 
        cin >> a[i];

    for (int i = 1; i <= m; i++) 
        cin >> b[i];

    sort(all(a));
    sort(all(b));

    if (n > m) {
        swap(a, b);
        swap(n, m);
    }

    int l = 0, r = 1e9, ans = -2;
    while (l <= r) {
        int mid = (l + r) / 2;
        if (check(mid)) {
            ans = mid;
            r = mid - 1;
        } else {
            l = mid + 1;
        }
    } 

    return ans;
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int t = 1;
    //cin >> t;

    while (t--) {
        cout << solve() << '\n';
    }

    return 0;
} 
 

• 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