Submission #855712

#TimeUsernameProblemLanguageResultExecution timeMemory
855712vjudge1Cipele (COCI18_cipele)C++17
90 / 90
39 ms3336 KiB
#ifndef Local #pragma GCC optimize("O3,unroll-loops") #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt") #endif #include <bits/stdc++.h> #define int long long #define pb push_back #define lim 100000 using namespace std; const int mod=1000000007ll; void solve(){ int n,m; cin>>n>>m; vector<int> a(n),b(m); for(int i=0;i<n;i++){ cin>>a[i]; } for(int i=0;i<m;i++){ cin>>b[i]; } sort(a.begin(),a.end()); sort(b.begin(),b.end()); if(m<n){ swap(n,m); swap(a,b); } int l=0,r=1e9,ans=INT_MAX; while(l<=r){ bool sure=1; int mid=(l+r)/2; int j=0; //cerr<<mid<<"\n"; for(int i=0;i<min(n,m);i++,j++){ if(m<=j){sure=0;break;} while(j<m&&mid<abs(a[i]-b[j])){ j++; } if(m<=j){sure=0;break;} //cerr<<i<<" "<<j<<"\n"; } //cerr<<sure<<"\n\n"; if(sure){ ans=mid; r=mid-1; }else{ l=mid+1; } } cout<<ans<<"\n"; } signed main(){ ios_base::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL); #ifdef Local freopen("in","r",stdin); freopen("out","w",stdout); #endif int t=1; //cin>>t; while (t--) { solve(); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...