Submission #81863

#	Time	Username	Problem	Language	Result	Execution time	Memory
81863		Shtef	Cipele (COCI18_cipele)	C++14	90 / 90	61 ms	10976 KiB

cipele

#include <iostream>
#include <algorithm>
 
using namespace std;
 
int n, m, a[100005], b[100005];
 
bool distval(int d){
    int j = 0;
    for(int i = 0; i < n ; ++i){
        while(j < m && b[j] < a[i] - d){
            j++;
        }
        if(j == m)
            return 0;
        if(b[j] > a[i] + d)
            return 0;
        j++;
    }
    return 1;
}
 
void solve(){
    int l = 0, h = 1e9;
    while(l < h){
        int mid = (l + h) / 2;
        if(distval(mid)){
            h = mid;
        }
        else{
            l = mid + 1;
        }
    }
    cout << l << endl;
}
 
int main ()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
for(int i = 0 ; i < n ; ++i){
    cin >> a[i];
}
sort(a, a + n);
for(int i = 0 ; i < m ; ++i){
    cin >> b[i];
}
sort(b, b + m);
if(n > m){
    swap(n, m);
    swap(a, b);
}
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