제출 #955673

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
955673		steveonalex	Just Long Neckties (JOI20_ho_t1)	C++17	100 / 100	163 ms	19392 KiB

ho_t1

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T& container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

const int N = 2e5 + 69;
int a[N], b[N], c[N];;
int pref[N], suff[N];

int main(void){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int n; cin >> n;
    for(int i = 1; i<=n+1; ++i) cin >> a[i];
    for(int i = 1; i<=n; ++i) cin >> b[i];

    for(int i = 1; i<=n+1; ++i) c[i] = a[i];

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

    for(int i = 1; i<=n; ++i) pref[i] = max(pref[i-1], max(0,a[i] - b[i]));
    for(int i = n+1; i>=2; --i) suff[i] = max(suff[i+1], max(0,a[i] - b[i-1]));

    map<int, int> ans;
    for(int i = 1; i<=n+1; ++i) {
        ans[a[i]] = max(pref[i-1], suff[i+1]);
    }

    for(int i = 1; i<=n+1; ++i) cout << ans[c[i]] << " ";
    cout << "\n";

    return 0;
}

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