제출 #818861

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
818861		vjudge1	Cipele (COCI18_cipele)	C++14	90 / 90	82 ms	1920 KiB

cipele

//***ZeroCoolCorp***//
#include <bits/stdc++.h>
#define ld long double
#define int long long

#define ll long long
  
using namespace std;
  
const int mxn = 1e5 + 5;
const int inf = 1e18;
const int mod = 1e9  +  7;
const int mxm = 105;

const ld eps = 1e-10;


vector<int> A(mxn);
vector<int> B(mxn);

int n,m;

bool yes(int x){
    int ptr = 0;

    for (int i = 0; i < n; i++) {
        if (abs(B[ptr] - A[i]) <= x) ptr++;
        if (ptr == m)return true;
    }

    return ptr == m ;
}

void solve(){
    
    cin>>n>>m;
    int hi = 0;
    for(int i = 0;i<n;i++){
        cin>>A[i];
        hi = max(hi, A[i]);
    }
    for(int i = 0;i<m;i++){
        cin>>B[i];

        hi = max(hi, B[i]);
    }

    if(n < m){
        swap(A, B);
        swap(n,m);
    }
    
    sort(A.begin(), A.begin() + n);
    sort(B.begin(), B.begin() + m);

    int lo = 0;
    
    while(hi > lo){
        int mid = (lo + hi)/2;
        //cout<<lo<<" "<<mid<<" "<<hi<<": "<<yes(mid)<<endl;

        if(yes(mid))hi = mid;
        else lo = mid+1;
    }

     cout<<lo<<endl;
    
}
  
int32_t main(){
    #ifdef ONLINE_JUDGE
    ios::sync_with_stdio(false);
    cin.tie(nullptrr);
    #endif
    int t = 1;
 //   cin>>t;
    while(t--)solve();
}

• 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