oj.uz

Submission #968668

# Submission time Handle Problem Language Result Execution time Memory
968668 2024-04-23T19:58:42 Z RandomUser Cipele (COCI18_cipele) C++17
90 / 90
 36 ms 2908 KB 
#include <bits/stdc++.h>
#define all(x) x.begin(), x.end()
 
using namespace std;
using ll = long long;
 
void setIO() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}
 
int32_t main() {
    setIO();
 
    int n, m;
    cin >> n >> m;
    vector<int> a(n), b(m);
 
    for(int &x : a) cin >> x;
    for(int &x : b) cin >> x;
    sort(all(a));
    sort(all(b));
 
    if(n == m) {
        int ans = 0;
        for(int i=0; i<n; i++)
            ans = max(ans, abs(a[i] - b[i]));
        cout << ans << '\n';
    } else {
        if(n > m) swap(a, b);
        int ans = 1e9;
        int l=0, r=max(b.back() - a[0], a.back() - b[0]);
 
        while(l <= r) {
            int mid = (l + r) / 2;
            int i=0, j=0, pairs = 0;
 
            while(i < min(n, m) && j < max(n, m)) {
                if(abs(a[i] - b[j]) <= mid) {
                    pairs++, i++, j++;
                } else if(a[i] - b[j] > mid) {
                    j++;
                } else if(a[i] - b[j] < mid) {
                    i++;
                }
            }
 
            if(pairs == min(n, m)) {
                ans = mid;
                r = mid - 1;
            } else if(pairs < min(n, m)) {
                l = mid + 1;
            }
        }
 
        cout << ans << '\n';
    }
 
    return 0;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 2652 KB Output is correct
2 Correct 31 ms 2908 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 2908 KB Output is correct
2 Correct 29 ms 2904 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 2 ms 472 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 2 ms 464 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 604 KB Output is correct
2 Correct 2 ms 348 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 3 ms 348 KB Output is correct

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 2 ms 348 KB Output is correct

Subtask #8
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 2392 KB Output is correct
2 Correct 20 ms 1884 KB Output is correct

Subtask #9
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 2652 KB Output is correct
2 Correct 15 ms 2056 KB Output is correct

Subtask #10
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 2472 KB Output is correct
2 Correct 26 ms 2648 KB Output is correct