oj.uz

Submission #521224

# Submission time Handle Problem Language Result Execution time Memory
521224 2022-02-01T08:45:08 Z KoD Cipele (COCI18_cipele) C++17
90 / 90
 55 ms 2888 KB 
#include <bits/stdc++.h>

using std::vector;
using std::array;
using std::pair;
using std::tuple;

int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int n, m;
    std::cin >> n >> m;
    vector<int> l(n), r(m);
    for (auto& x : l) std::cin >> x;
    for (auto& x : r) std::cin >> x;
    if (n > m) {
        std::swap(n, m);
        std::swap(l, r);
    }
    std::sort(l.begin(), l.end());
    std::sort(r.begin(), r.end());
    const auto check = [&](const int thres) {
        int j = 0;
        for (int i = 0; i < n; ++i) {
            while (j < m and std::abs(l[i] - r[j]) > thres) j += 1;
            if (j == m) return false;
            j += 1;
        }
        return true;
    };
    int ok = 1000000000, ng = -1;
    while (ok - ng > 1) {
        const int md = (ok + ng) / 2;
        (check(md) ? ok : ng) = md;
    }
    std::cout << ok << '\n';
    return 0;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 2612 KB Output is correct
2 Correct 42 ms 2868 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 2868 KB Output is correct
2 Correct 41 ms 2888 KB Output is correct

Subtask #3
9.0 / 9.0

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

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 332 KB Output is correct
2 Correct 4 ms 452 KB Output is correct

Subtask #5
9.0 / 9.0

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

Subtask #6
9.0 / 9.0

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

Subtask #7
9.0 / 9.0

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

Subtask #8
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 2340 KB Output is correct
2 Correct 24 ms 1792 KB Output is correct

Subtask #9
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 2604 KB Output is correct
2 Correct 18 ms 1896 KB Output is correct

Subtask #10
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 2324 KB Output is correct
2 Correct 39 ms 2492 KB Output is correct