이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#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;
int32_t main(){
faster
int n,m;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);
}
// v.push_back(0),t.push_back(0);
sort(v.begin(),v.end());
sort(t.begin(),t.end());
v.push_back(OYY),t.push_back(OYY);
if(m<n){
swap(v,t);
swap(n,m);
}
int maxi=0;
for(int i=0;i<n;i++){
int c=lower_bound(t.begin(),t.end(),v[i])-t.begin();
if(c-1>=1){
int deg=t[c-1];
//cout<<t[c]<<" "<<deg<<endl;
if(abs(t[c]-v[i])>abs(deg-v[i])){
maxi=max(maxi,abs(deg-v[i]));
t.erase(t.begin()+c-1);
continue;
}
maxi=max(maxi,abs(t[c]-v[i]));
t.erase(t.begin()+c);
}
else{
maxi=max(maxi,abs(t[c]-v[i]));
t.erase(t.begin()+c);
}
}
cout<<maxi<<'\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... |