Submission #1216000

#	Time	Username	Problem	Language	Result	Execution time	Memory
1216000		sunflower	Just Long Neckties (JOI20_ho_t1)	C++17	100 / 100	57 ms	6980 KiB

ho_t1

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define MASK(x) (1LL << (x))
#define BIT(x, i) (((x) >> (i)) & 1)
#define SZ(x) ((int) (x).size())
#define ALL(a) (a).begin(), (a).end()
#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; ++i)
#define FORD(i, a, b) for (int i = (a), _b = (b); i >= _b; --i)
#define REP(i, n) for (int i = 0, _n = (n); i < _n; ++i)
#define debug(x) cout << "[" << #x << " = " << (x) << "]" << endl

#define left    __left
#define right   __right
#define prev    __prev
#define next    __next
#define fi      first
#define se      second

template <class X, class Y>
    bool maximize(X &x, Y y) {
        if (x < y) return x = y, true;
        else return false;
    }

template <class X, class Y>
    bool minimize(X &x, Y y) {
        if (x > y) return x = y, true;
        else return false;
    }

#define MAX_N 200'200
pair <int, int> a[MAX_N + 2];
int b[MAX_N + 2];
int pre[MAX_N + 2], suf[MAX_N + 2], res[MAX_N + 2];

int n;

int main() {
    ios_base::sync_with_stdio(false);cin.tie(nullptr);
    cin >> n;
    FOR(i, 1, n + 1) cin >> a[i].fi, a[i].se = i;
    sort(a + 1, a + 1 + (n + 1));

    FOR(i, 1, n) cin >> b[i];
    sort(b + 1, b + 1 + n);

    pre[0] = 0;
    FOR(i, 1, n) pre[i] = max(pre[i - 1], a[i].fi - b[i]);

    suf[n + 2] = 0;
    FORD(i, n + 1, 2) suf[i] = max(suf[i + 1], a[i].fi - b[i - 1]);

    FOR(i, 1, n + 1) {
        res[a[i].se] = max(pre[i - 1], suf[i + 1]);
    }

    FOR(i, 1, n + 1) cout << res[i] << " ";

    return 0;
}

/* Discipline - Calm */

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