제출 #1332241

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1332241		yusifm	Cipele (COCI18_cipele)	C++20	90 / 90	49 ms	2664 KiB

cipele

#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define str string
#define pb push_back
#define pf push_front
#define in insert
#define all(v) v.begin(),v.end()
const ll sz=101,INF=1000000000000000000;
using namespace std;
void solve()
{
    ll n,m,num1,num2,left=0,right=INF,middle,idx1,idx2,ans;
    cin>>n>>m;
    vector<ll>nums1,nums2;
    for(int i=0;i<n;i++)
    {
        cin>>num1;
        nums1.pb(num1);
    }
    for(int i=0;i<m;i++)
    {
        cin>>num2;
        nums2.pb(num2);
    }
    sort(all(nums1)),sort(all(nums2));
    if(nums1.size()>nums2.size())
    {
        swap(nums1,nums2);
    }
    while(left<=right)
    {
        middle=(left+right)/2,idx1=0,idx2=0;
        while(idx1<nums1.size() && idx2<nums2.size())
        {
            if(abs(nums1[idx1]-nums2[idx2])<=middle)
            {
                idx1++,idx2++;
            }
            else
            {
                idx2++;
            }
        }
        if(idx1!=nums1.size())
        {
            left=middle+1;
        }
        else
        {
            right=middle-1,ans=middle;
        }
    }
    cout<<ans;
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr),cout.tie(nullptr);
    ll 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