제출 #894302

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
894302		vjudge1	Cipele (COCI18_cipele)	C++17	90 / 90	33 ms	2896 KiB

cipele

#include <iostream>
#include <fstream>
#include <iomanip>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <string>
#include <cmath>
#include <cassert>
#include <ctime>
#include <algorithm>
#include <sstream>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <cstdlib>
#include <cstdio>
#include <iterator>
#include <functional>
#include <unordered_set>
#include <unordered_map>
#include <stdio.h>
#include <bitset>
#include <cstdint>
#include <cassert>
#include <functional>
#include <complex>
#include <climits>
#include <random>
using namespace std;
   
#define ll long long
#define pb push_back
#define ull unsigned long long
#define F first
#define S second
#define all(v) v.begin(), v.end()

const int INF = INT_MAX;

int a[200001], n, m;
int b[200001];

bool bruh(ll x){
    for(int l = 1, r = 1; l <= n; l++, r++){
        while(r <= m && abs(b[r] - a[l]) > x) r++;
        if(r > m) return 0;
    }
    return 1;
}

void solve(){
    cin >> n >> m;
    for(int i = 1; i <= n; i++) cin >> a[i];
    for(int i = 1; i <= m; i++) cin >> b[i];
    if(n > m){
        swap(a, b), swap(n, m);
    }
    sort(a + 1, a + 1 + n), sort(b + 1, b + 1 + m);
    ll l = -1, r = 2e9;
    while(r - l > 1){
        ll mid = (l + r) / 2;
        if(bruh(mid)) r = mid;
        else l = mid;
    }
    cout << r;
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL), cout.tie(NULL);
    int xach = 1; 
    //cin >> xach;
    while(xach--) 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