Submission #1277413

#	Time	Username	Problem	Language	Result	Execution time	Memory
1277413		hiepsimauhong	Just Long Neckties (JOI20_ho_t1)	C++20	100 / 100	68 ms	11596 KiB

ho_t1

#include <bits/stdc++.h>

using namespace std;

#define int long long

#define FOR(I, L, R) for(int I(L) ; I <= (int)R ; ++I)
#define FOD(I, R, L) for(int I(R) ; I >= (int)L ; --I)
#define FOA(I, A) for(auto &I : A)

#define print(A,L,R) FOR(OK, L, R){if(A[OK]<=-oo / 10||A[OK]>=oo)cout<<"- ";else cout<<A[OK]<<' ';}cout<<'\n';
#define prints(A) FOA(OK, A){cout<<OK<<' ';}cout << '\n';
#define printz(A,L,R) FOR(OK, 1, L){FOR(KO, 1, R){if(A[OK][KO]>-oo&&A[OK][KO]<oo)cout<<A[OK][KO]<<' ';else cout << "- ";} cout << '\n';}cout << '\n';

#define fs first
#define sd second
#define ii pair<int,int>
#define iii pair<int, ii>
#define all(A) A.begin(), A.end()
#define quickly cin.tie(0) -> ios_base::sync_with_stdio(0);

const int N = 2e5 + 5;
const int mod = 1e9 + 7;
const int oo = 1e9;

int n;
ii a[N];
int b[N], ans[N];
int pre[N], suf[N];

signed main(){ quickly
        cin >> n;

        FOR(i, 1, n + 1){
                cin >> a[i].fs;
                a[i].sd = i;
        }

        FOR(i, 1, n){
                cin >> b[i];
        }

        sort(a + 1, a + 2 + n);
        sort(b + 1, b + 1 + n);

        FOR(i, 1, n){
                pre[i] = max(pre[i - 1], max(a[i].fs - b[i], 0LL));
        }

        FOD(i, n + 1, 1){
                suf[i] = max(suf[i + 1], max(a[i].fs - b[i - 1], 0LL));
        }

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

        FOR(i, 1, n + 1){
                cout << ans[i] << ' ';
        }
}

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