제출 #779483

#제출 시각아이디문제언어결과실행 시간메모리
779483vjudge1Cipele (COCI18_cipele)C++17
0 / 90
29 ms3024 KiB
//#include<bits/stdc++.h> #include<iostream> #include<bitset> #include<algorithm> using namespace std; #define lalala ios_base::sync_with_stdio(false);cin.tie(NULL); #define endl "\n" #define pb push_back #define N 100005 bitset<N> var; int main(){ lalala; int n,m; vector<int> a,b;cin>>n>>m; for(int i=0;i<n;i++){ int aa;cin>>aa; a.pb(aa); } for(int i=0;i<m;i++){ int bb;cin>>bb; b.pb(bb); } sort(a.begin(),a.end()); sort(b.begin(),b.end()); if(n>m){ swap(n,m);swap(a,b); } int l=0,r=1;//000000000; while(l<=r){ int mid=(l+r)/2; int ind=0; int check=0; //cout<<l<<" "<<r<<endl; for(int i=0;i<n;i++){ int ok=0; while(ind<m){ //cout<<a[i]<<" "<<b[ind]<<" "<<ind<<" "<<i<<endl; if(abs(a[i]-b[ind])<=mid){ ok=1; break; } ind++; } if(ok==0){ check=1; break; } } if(check)l=mid+1; else r=mid-1; } cout<<l<<endl; }
#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...