oj.uz

Submission #472432

# Submission time Handle Problem Language Result Execution time Memory
472432 2021-09-13T14:28:56 Z _L__ Cipele (COCI18_cipele) C++17
90 / 90
 356 ms 1864 KB 
// This code is written by _L__
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<class T> using ordered_set = tree<T, null_type , less<T> , rb_tree_tag , tree_order_statistics_node_update>;
#define endl '\n'
#define F_word ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
typedef long long ll;
typedef long double ld;
const ll mod = 1e9+7, N = 1e5+300, inf = 1e18;
const ld E = 1e-6;
#define ff first
#define ss second

ll a[N], b[N], n, m;

bool check(ll mid){
    ll cnt = 0;
    ll cur = 0-1;
    if(n<=m){
        for(int i = 0; i < n; ++i){
            ll l = lower_bound(b, b+m, a[i]-mid)-b;
            ll r = upper_bound(b, b+m, a[i]+mid)-b-1;
            if(l>r)return 0;
            if(cur+1 <= r){cur = max(l, cur+1); ++cnt;}
        }
        return (cnt >= n);
    } else {
        for(int i = 0; i < m; ++i){
            ll l = lower_bound(a, a+n, b[i]-mid)-a;
            ll r = upper_bound(a, a+n, b[i]+mid)-a-1;
            if(l>r) return 0;
            if(cur+1 <= r){cur = max(l, cur+1); ++cnt;}
        }
        return (cnt>=m);
    }
}

ll lower(){
    ll l = 0, r = 1e11, ans = 0;
    while(l <= r){
        ll mid = (l+r)/2;
        if(check(mid)){
            ans = mid;
            r = mid-1;
        } else l = mid+1;
    }
    return ans;
}

int main(void){
    F_word;
    cin >> n >> m;
    for(int i = 0; i < n; ++i) cin >> a[i];
    for(int i = 0; i < m; ++i) cin >> b[i];
    sort(a, a+n); sort(b, b+m);
    cout << lower() << endl;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 331 ms 1864 KB Output is correct
2 Correct 355 ms 1864 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 356 ms 1864 KB Output is correct
2 Correct 351 ms 1772 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 368 KB Output is correct
2 Correct 10 ms 404 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 9 ms 460 KB Output is correct

Subtask #5
9.0 / 9.0

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

Subtask #6
9.0 / 9.0

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

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 400 KB Output is correct
2 Correct 10 ms 404 KB Output is correct

Subtask #8
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 258 ms 1604 KB Output is correct
2 Correct 207 ms 1196 KB Output is correct

Subtask #9
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 326 ms 1688 KB Output is correct
2 Correct 195 ms 1452 KB Output is correct

Subtask #10
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 262 ms 1556 KB Output is correct
2 Correct 296 ms 1624 KB Output is correct