oj.uz

Submission #99161

# Submission time Handle Problem Language Result Execution time Memory
99161 2019-03-01T06:36:58 Z M_H_H_7 Cipele (COCI18_cipele) C++14
90 / 90
 357 ms 4340 KB 
//In The Name of Beauty
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#define IB std::ios::sync_with_stdio(0);
#define pb(x) push_back(x);
#define mp(x,y) make_pair(x,y)
#define pll pair<ll,ll>
#define F first
#define S second
ll const MAXN = 1e5 + 8;
ll const INF  = 1e9;
ll const delta = 1000000007;
vll a , b;
ll n , m;
bool mar[MAXN];
bool check(ll x)
{
    ll last = m;
    for(ll i = n - 1;i >= 0;i--){
        ll r = upper_bound(b.begin(),b.end(),a[i] + x) - b.begin() - 1;
        ll l = lower_bound(b.begin(),b.end(),a[i] - x) - b.begin();
        if(l > r)return 0;
        if(l > last - 1)return 0;
        last = min(last - 1,r);
    }
    return 1;
}
int main()
{
    IB;
    cin.tie(0);
    cout.tie(0);
    cin >> n >> m;
    ll t;
    for(ll i = 0;i < n;i++){
        cin >> t;
        a.pb(t);
    }
    for(ll i = 0;i < m;i++){
        cin >> t;
        b.pb(t);
    }
    if(a.size() > b.size()){
        swap(a,b);
        swap(n,m);
    }
    sort(a.begin(),a.end());
    sort(b.begin(),b.end());
    ll l = 0 , r = INF , mid = (l + r) / 2;
    while(r - l > 1){
        if(check(mid))r = mid;
        else l = mid;
        mid = (l + r) / 2;
    }
    if(check(l))return cout << l,0;
    cout << r;
    return 0;
}
//Written by M_H_H_7

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 273 ms 4208 KB Output is correct
2 Correct 331 ms 4336 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 193 ms 4336 KB Output is correct
2 Correct 357 ms 4340 KB Output is correct

Subtask #3
9.0 / 9.0

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

Subtask #4
9.0 / 9.0

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

Subtask #5
9.0 / 9.0

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

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 512 KB Output is correct
2 Correct 12 ms 640 KB Output is correct

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 512 KB Output is correct
2 Correct 9 ms 640 KB Output is correct

Subtask #8
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 127 ms 3820 KB Output is correct
2 Correct 139 ms 2616 KB Output is correct

Subtask #9
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 154 ms 4080 KB Output is correct
2 Correct 171 ms 3192 KB Output is correct

Subtask #10
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 186 ms 3848 KB Output is correct
2 Correct 174 ms 4208 KB Output is correct