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>
#define fi first
#define se second
#define ll long long
#define pb push_back
using namespace std;
int n,a[10005],b[5005],c[5005];
int dp[5005][5005];
int get(int l,int r)
{
vector<int> vb,vc;
for(int i=1;i<l;i++) vc.pb(a[i]);
for(int i=l;i<=r;i++) vb.pb(a[i]);
for(int i=r+1;i<=2*n;i++) vc.pb(a[i]);
sort(vc.begin(),vc.end());
sort(vb.begin(),vb.end());
int mx1=0,mx2=0;
for(int i=1;i<=n;i++)
{
mx1=max(mx1,abs(b[i]-vb[i-1]));
}
for(int i=1;i<=n;i++)
{
mx1=max(mx1,abs(c[i]-vc[i-1]));
}
for(int i=1;i<=n;i++)
{
mx2=max(mx2,abs(c[i]-vb[i-1]));
}
for(int i=1;i<=n;i++)
{
mx2=max(mx2,abs(b[i]-vc[i-1]));
}
return min(mx2,mx1);
}
bool check(int mid)
{
for(int i=1;i<=n+1;i++)
{
int mx=0;
mx=dp[i][i+n-1];
if(mx<=mid) return true;
}
return false;
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
// freopen(".INP","r",stdin);
// freopen(".OUT","w",stdout);
cin>>n;
for(int i=1;i<=n*2;i++)
{
cin>>a[i];
}
for(int i=1;i<=n;i++)
{
cin>>b[i];
}
for(int i=1;i<=n;i++)
{
cin>>c[i];
}
sort(b+1,b+1+n);
sort(c+1,c+1+n);
for(int i=1;i<=n+1;i++)
{
int j=i+n-1;
dp[i][j]=get(i,j);
}
int l=0,r=1e9,res=0;
while(l<=r)
{
int mid=(l+r)/2;
if(check(mid))
{
res=mid;
r=mid-1;
}
else l=mid+1;
}
cout<<res;
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... |