This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define faster ios_base::sync_with_stdio(false);cin.tie(NULL);
#define OYY 1000000005
#define mod 998244353
vector <int> v,t;
int n,m,mid,cev=OYY,tut;
inline bool yes(int x){
tut=0;
for(int i=0;i<m;i++){
if(tut>=n){
break;
}
if(abs(t[i]-v[tut])>x)continue;
tut++;
}
if(tut>=n)return true;
else return false;
}
int32_t main(){
faster
cin>>n>>m;
int deg;
for(int i=0;i<n;i++){
cin>>deg;
v.push_back(deg);
}
for(int i=0;i<m;i++){
cin>>deg;
t.push_back(deg);
}
if(m<n){
swap(n,m);
swap(v,t);
}
int l=0,r=1000000009;
while(l<=r){
mid=(l+r)/2;
if(yes(mid)){
r=mid-1;
cev=mid;
}
else l=mid;
}
cout<<cev<<'\n';
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |