Submission #330569

#	Time	Username	Problem	Language	Result	Execution time	Memory
330569		Sho10	Just Long Neckties (JOI20_ho_t1)	C++14	100 / 100	119 ms	15596 KiB

ho_t1

#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho10
#define ll long long
#define double long double
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define pi pair
#define rc(s) return cout<<s,0
#define endl '\n'
#define mod (10*10*10*10*10*10*10*10*10+7)
#define PI 3.14159265359
#define MAXN 100005
#define INF 1000000005
#define LINF 1000000000000000005ll
#define CODE_START  ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
ll n,b[200005],pref[200005],suf[200005],ans[200005];
pair<ll,ll>a[200005];
int32_t main(){
CODE_START;
cin>>n;
for(ll i=1;i<=n+1;i++)
{
    cin>>a[i].f;
    a[i].s=i;
}
for(ll i=1;i<=n;i++)
{
    cin>>b[i];
}
sort(a+1,a+n+2);
sort(b+1,b+n+1);
for(ll i=1;i<=n+1;i++)
{
    pref[i]=max(pref[i-1],a[i].f-b[i]);
}
for(ll i=n+1;i>=2;i--)
{
    suf[i]=max(suf[i+1],a[i].f-b[i-1]);
}
for(ll i=1;i<=n+1;i++)
{
    ans[a[i].s]=max(pref[i-1],suf[i+1]);
}
for(ll i=1;i<=n+1;i++)
{
    cout<<ans[i]<<' ';
}
}

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