Submission #1295864

#	Time	Username	Problem	Language	Result	Execution time	Memory
1295864		trandaihao5555	Just Long Neckties (JOI20_ho_t1)	C++20	100 / 100	66 ms	11660 KiB

ho_t1

#include <bits/stdc++.h>

#define int long long

#define debug     cout << "ok\n";
#define SQR(x)    (1LL * ((x) * (x)))
#define MASK(i)   (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)
#define fi        first
#define se        second
#define pb        push_back

#define mp make_pair
#define pii pair<int,int>
#define pli pair<ll,int>
#define vi vector<int>

#define FAST ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef unsigned int ui;

using namespace std;

const int M = 1e9 + 7;
const int INF = 1e9 + 7;
const ll INFLL = (ll)2e18 + 7LL;
const ld PI = acos(-1);

const int dx[] = {1, -1, 0, 0, -1, 1, 1, -1};
const int dy[] = {0, 0, 1, -1, -1, -1, 1, 1};

template<class _, class __>
    bool minimize(_ &x, const __ y){
        if(x > y){
            x = y;
            return true;
        } else return false;
    }
template<class _, class __>
    bool maximize(_ &x, const __ y){
        if(x < y){
            x = y;
            return true;
        } else return false;
    }

template<class _,class __>
    void Add(_ &x, const __ y) {
        x += y;
        if (x >= M) {
            x -= M;
        }
        return;
    }

template<class _,class __>
    void Diff(_ &x, const __ y) {
        x -= y;
        if (x < 0) {
            x += M;
        }
        return;
    }

//--------------------------------------------------------------

const int MaxN = 1e6+7;

int n,b[MaxN],res[MaxN],pre[MaxN],suf[MaxN];
pii a[MaxN];

void sol() {
    cin >> n;
    for (int i=1;i<=n+1;i++) {
        cin >> a[i].fi;
        a[i].se = i;
    }
    for (int i=1;i<=n;i++) cin >> b[i];
    sort(a+1,a+n+2);
    sort(b+1,b+n+1);
//    for (int i=1;i<=n+1;i++) cout << a[i].fi << ' '; cout << '\n';
//    for (int i=1;i<=n+1;i++) cout << b[i] << ' '; cout << '\n';
    for (int i=1;i<=n;i++) {
        pre[i] = max(pre[i-1],a[i].fi-b[i]);
//        cout << pre[i] << ' ';
    }
//    cout << '\n';
    for (int i=n;i>=1;i--) {
        suf[i] = max(suf[i+1],a[i+1].fi-b[i]);
//        cout << suf[i] << ' ';
    }
//    cout << '\n';
    for (int i=1;i<=n+1;i++) {
        res[a[i].se] = max(pre[i-1],suf[i]);
    }
    for (int i=1;i<=n+1;i++) cout << res[i] << ' ';
}

signed main() {
//    freopen("test.inp","r",stdin);
//    freopen("test.out","w",stdout);
    FAST
    int t=1;
//    cin >> t;
    while (t--) sol();
}

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