# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
733493 | pcc | Just Long Neckties (JOI20_ho_t1) | C++14 | 116 ms | 17116 KiB |
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>
using namespace std;
#define ll long long
#define pll pair<ll,ll>
#define fs first
#define sc second
void solve(){
int n;
cin>>n;
pll arr[n+1];
for(int i = 0;i<=n;i++){
arr[i].sc = i;
cin>>arr[i].fs;
}
pll brr[n];
for(int i = 0;i<n;i++){
brr[i].sc = i;
cin>>brr[i].fs;
}
sort(arr,arr+n+1);
sort(brr,brr+n);
ll pref[n+1];
ll suf[n+1];
pref[0] = max(0LL,arr[0].fs-brr[0].fs);
ll ans[n+1];
for(int i = 1;i<n;i++){
pref[i] = max(pref[i-1],max(0LL,arr[i].fs-brr[i].fs));
}
suf[n] = max(0LL,arr[n].fs-brr[n-1].fs);
for(int i = n-1;i>=1;i--){
suf[i] = max(suf[i+1],max(0LL,arr[i].fs-brr[i-1].fs));
}
ans[arr[0].sc] = suf[1];
ans[arr[n].sc] = pref[n-1];
for(int i = 1;i<n;i++){
ans[arr[i].sc] = max(pref[i-1],suf[i+1]);
}
for(int i = 0;i<=n;i++)cout<<ans[i]<<' ';cout<<'\n';
return;
}
int main(){
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int t = 1;
while(t--)solve();
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |