Submission #1352239

#TimeUsernameProblemLanguageResultExecution timeMemory
1352239guardianecJust Long Neckties (JOI20_ho_t1)C++20
100 / 100
54 ms11748 KiB
#include <bits/stdc++.h>
#define ll long long
using namespace std;

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    ll n;
    cin >> n;
    vector<pair<ll,ll>> a(n+1);
    for (int i=0; i<=n; i++) {
        cin >> a[i].first;
        a[i].second = i;
    }
    vector<ll> b(n);
    for (int i=0; i<n; i++) {
        cin >> b[i];
    }
    
    sort(a.begin(), a.end());
    sort(b.begin(), b.end());

    vector<ll> pref(n+2);
    for (int i=0; i<n; i++) {
        pref[i+1] = max(pref[i], max(0LL, a[i].first-b[i]));
    }
    vector<ll> suff(n+2);
    for (int i=n; i>=1; i--) {
        suff[i] = max(suff[i+1], max(0LL, a[i].first-b[i-1]));
    }

    vector<ll> res(n+1);
    for (int i=0; i<=n; i++) {
        res[a[i].second] = max(pref[i], suff[i+1]);
    }

    for (int i=0; i<=n; i++) {
        cout << res[i] << " ";
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...