제출 #311481

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
311481		neki	Cipele (COCI18_cipele)	C++14	0 / 90	4 ms	640 KiB

cipele

#include <bits/stdc++.h>
#define loop(i, a, b) for(long long i=a;i<b;i++)
#define pool(i, a, b) for(long long i=a-1;i>=b;i--)
#define fore(i, a) for(auto&& i:a)
#define fi first
#define se second
#define ps(a) push_back(a)
#define pb(a) pop_back(a)
#define sc scanf
#define vc vector
#define pa pair<ll, ll>
#define ll long long
#define lb lower_bound
#define ub upper_bound
#define all(a) a.begin(), a.end()
#define llmax LLONG_MAX/2
#define llmin -LLONG_MAX/2
using namespace std;
#define mn 2600
#define pa pair<ll, ll>
#define ld long double 
ll a[mn], b[mn], n, m;
ll al =30;
ll solve(ll d){
    ll j=0;
    loop(i, 0, n){
        while(j<m and abs(a[i]-b[j])>d)j++;
        if(j>=m or abs(a[i]-b[j])>d) return 0;
        j++;
    }
    return 1;
}
int main(){
    cin >> n>> m;
    loop(i, 0, n) cin >> a[i];
    loop(i, 0, m) cin >> b[i];
    if(n>m)swap(a, b), swap(n, m);
    sort(a, a+n);
    sort(b, b+n);
    ll cnt=(1<<al)-1;
    pool(i, al, 0) if(solve(cnt-(1<<i)))cnt-=(1<<i);
    cout << cnt <<endl;
}

• Subtask 1: 0 / 9
• Subtask 2: 0 / 9
• Subtask 3: 0 / 9
• Subtask 4: 0 / 9
• Subtask 5: 0 / 9
• Subtask 6: 0 / 9
• Subtask 7: 0 / 9
• Subtask 8: 0 / 9
• Subtask 9: 0 / 9
• Subtask 10: 0 / 9