Submission #547239

#	Time	Username	Problem	Language	Result	Execution time	Memory
547239		AbdelmagedNour	Just Long Neckties (JOI20_ho_t1)	C++17	100 / 100	90 ms	10828 KiB

ho_t1

#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin>>n;
    pair<int,int>a[n+1];
    int arr[n],pre[n],suf[n],ans[n+1];
    for(int i=0;i<=n;i++)cin>>a[i].first,a[i].second=i;
    for(int i=0;i<n;i++)cin>>arr[i];
    sort(a,a+n+1);
    sort(arr,arr+n);
    for(int i=0;i<n;i++){
        pre[i]=max(a[i].first-arr[i],0);
        suf[i]=max(a[i+1].first-arr[i],0);
    }
    for(int i=1;i<n;i++)pre[i]=max(pre[i],pre[i-1]);
    for(int i=n-2;i>=0;i--)suf[i]=max(suf[i],suf[i+1]);
    ans[a[0].second]=suf[0];
    ans[a[n].second]=pre[n-1];
    for(int i=1;i<n;i++){
        ans[a[i].second]=max(pre[i-1],suf[i]);
    }
    for(int i=0;i<=n;i++)cout<<ans[i]<<" ";
    return 0;
}

• Subtask 1: 1 / 1
• Subtask 2: 8 / 8
• Subtask 3: 91 / 91