제출 #1010527

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1010527		Almonther	Cipele (COCI18_cipele)	C++98	90 / 90	46 ms	3164 KiB

cipele

#include <bits/stdc++.h>

#define suiii ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long
#define co cout<<
//#pragma GCC optimize("O3,Ofast,unroll-loops")
//#pragma GCC target("avx2,sse3,sse4,avx")
using namespace std;
//stuff
ll n,m;
ll arr[1000001];
ll arr1[1000001];
void solve(){
    cin>>n>>m;
    if(n>m){
        for(int i=1;i<=n;i++) cin>>arr1[i];
        for(int i=1;i<=m;i++) cin>>arr[i];
        swap(n,m);
    }
    else{
        for(int i=1;i<=n;i++) cin>>arr[i];
        for(int i=1;i<=m;i++) cin>>arr1[i];
    }
    sort(arr,arr+n);
    sort(arr1,arr1+m);
    ll l,r;
    l=0,r=1e15;
    while(l<=r){
        ll mid=(l+r)/2;
        ll l1,r1;
        l1=0,r1=0;
        while(l1<n&&r1<m){
            if(abs(arr[l1]-arr1[r1])<=mid) l1++,r1++;
            else r1++;
        }
        if(l1==n) r=mid-1;
        else l=mid+1;
    }
    co r+1;
}

int main()
{
    suiii
    int tt=1;
    // cin>>tt;
    while(tt--){
        solve();
    }
    return 0;
}

• 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