Submission #795237

#	Time	Username	Problem	Language	Result	Execution time	Memory
795237		Theo830	Just Long Neckties (JOI20_ho_t1)	C++17	100 / 100	90 ms	17200 KiB

ho_t1

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e9+7;
const ll MOD = 998244353;
typedef pair<ll,ll> ii;
#define iii pair<ll,ii>
#define f(i,a,b) for(ll i = a;i < b;i++)
#define pb push_back
#define vll vector<ll>
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
///I hope I will get uprating and don't make mistakes
///I will never stop programming
///sqrt(-1) Love C++
///Please don't hack me
///@TheofanisOrfanou Theo830
///Think different approaches (bs,dp,greedy,graphs,shortest paths,mst)
///Stay Calm
///Look for special cases
///Beware of overflow and array bounds
///Think the problem backwards
///Training
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    ll n;
    cin>>n;
    ll a[n+1];
    ll b[n];
    vector<ii>ar;
    ll ans[n+1];
    f(i,0,n+1){
        cin>>a[i];
        ar.pb(ii(a[i],i));
    }
    sort(all(ar));
    f(i,0,n){
        cin>>b[i];
    }
    sort(b,b+n);
    ll pre[n+2] = {0},suf[n+2] = {0};
    f(i,0,n){
        pre[i+1] = max(pre[i],ar[i].F - b[i]);
    }
    for(ll i = n;i >= 1;i--){
        suf[i] = max(suf[i+1],ar[i].F - b[i-1]);
    }
    f(i,0,n+1){
        ans[ar[i].S] = max(pre[i],suf[i+1]);
    }
    f(i,0,n+1){
        cout<<ans[i]<<" ";
    }
}

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