Submission #364888

#	Time	Username	Problem	Language	Result	Execution time	Memory
364888		farhan132	Just Long Neckties (JOI20_ho_t1)	C++17	100 / 100	126 ms	17244 KiB

ho_t1

/***Farhan132***/

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
typedef double dd;
typedef vector<ll> vll;
typedef pair<ll , ll> ii;
typedef vector< ii > vi;
typedef pair < pair < ll , ll > , pair < ll , ll > > cm; 
 
#define ff first
#define ss second
#define pb push_back
#define in insert
#define f0(b) for(int i=0;i<(b);i++)
#define f00(b) for(int j=0;j<(b);j++)
#define f1(b) for(int i=1;i<=(b);i++)
#define f11(b) for(int j=1;j<=(b);j++)
#define f2(a,b) for(int i=(a);i<=(b);i++)
#define f22(a,b) for(int j=(a);j<=(b);j++)
#define sf(a) scanf("%lld",&a)
#define sff(a,b) scanf("%lld %lld", &a , &b)
#define pf(a) printf("%lld\n",a)
#define pff(a,b) printf("%lld %lld\n", a , b)
#define PI 3.14159265359
#define bug printf("**!\n")
#define mem(a , b) memset(a, b ,sizeof(a))
#define front_zero(n) __builtin_clzll(n)
#define back_zero(n) __builtin_ctzll(n)
#define total_one(n) __builtin_popcountll(n)
#define clean fflush(stdout)

const ll mod =  (ll)1e9 + 7;
const ll maxn = (ll)2e5 + 5;
const int nnn = 1048590;
const int inf = numeric_limits<int>::max()-1;
//const ll INF = numeric_limits<ll>::max()-1;
//const ll INF = 1e18;
 
ll dx[]={0,1,0,-1};
ll dy[]={1,0,-1,0};
ll dxx[]={0,1,0,-1,1,1,-1,-1};
ll dyy[]={1,0,-1,0,1,-1,1,-1};

void solve(){
    
    ll n;
    cin >> n;
    ll suf[n+5] , pref[n+5];
    f0(n+5) suf[i] = pref[i] = 0;
    ll a[n+5] , b[n+5] , ans[n+5];
    vector < ii > v; 
    f1(n+1) cin >> a[i] , v.pb({a[i] , i});
    f1(n) cin >> b[i];
    sort(v.begin() ,  v.end());
    sort(b+1, b+n+1);
    for(ll i = n; i >= 1; i--) suf[i] = max(suf[i+1] , max(v[i].ff - b[i] , 0LL)) ;
    for(ll i = 0; i < n; i++){
        pref[i] = max(pref[i] , max(v[i].ff - b[i+1] , 0LL));
        pref[i+1] = pref[i];
    }
    for(ll i = 0; i <= n; i++){
        ll res = 0;
        if(i != 0) res = pref[i-1];
        if(i != n) res = max(res , suf[i+1]);
        ans[v[i].ss] = res;
    }
    f1(n+1) cout << ans[i] << ' ';
    
    return;
    
}

 
int main() {
    
    
    #ifdef LOCAL
        freopen("in.txt", "r", stdin);
        freopen("out.txt", "w", stdout);
    #else 
     //   freopen("cbarn2.in", "r", stdin);
     //   freopen("cbarn2.out", "w", stdout);
     ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
    #endif
    //cout << fixed << setprecision(10);
   // work(maxn);
    //  mem(b,0);
    ll T;
    T=1;
    //cin >> T; 
    //scanf("%lld",&T);
   // ll CT = 0;
    //work();
    while(T--){
        //cout << "Case " << ++CT <<": " ;
        //printf("Case %lld: ",++CT);
        solve();
    }
 
    return 0;
}

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