This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
//#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define X first
#define Y second
int n;
int orgar[500005];
int ar[500005];
int br[500005];
int psans[500005];
int sfans[500005];
signed main(){
cin>>n;
for(int i=1;i<=n+1;i++){
cin>>orgar[i];
ar[i]=orgar[i];
}
for(int i=1;i<=n;i++){
cin>>br[i];
}
sort(ar+1,ar+n+1+1);
sort(br+1,br+n+1);
for(int i=1;i<=n;i++){
psans[i]=max(psans[i-1],ar[i]-br[i]);
}
for(int i=n+1;i>=2;i--){
sfans[i]=max(sfans[i+1],ar[i]-br[i-1]);
}
map<int,int>mp;
for(int i=1;i<=n+1;i++){
mp[ar[i]]=max(psans[i-1],sfans[i+1]);
}
for(int i=1;i<=n+1;i++){
cout<<mp[orgar[i]]<<" ";
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |