제출 #1181354

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1181354		TudorMa	Just Long Neckties (JOI20_ho_t1)	C++20	0 / 100	0 ms	320 KiB

ho_t1

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define fi first
#define sc second
#define pb push_back

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef double db;
typedef pair<int, int> pii;
template<typename type>
using ordered_set = tree<type, null_type, less<type>, rb_tree_tag, tree_order_statistics_node_update>;

const int N = 2e5 + 5, mod = 1e9 + 7, inf = 2e9;
const int dl[] = {-1, 0, 1, 0}, dc[] = {0, 1, 0, -1};
const int ddl[] = {-1, -1, -1, 0, 1, 1, 1, 0}, ddc[] = {-1, 0, 1, 1, 1, 0, -1, -1};

mt19937 gen(chrono::steady_clock::now().time_since_epoch().count());
int rng(int lo = 1, int hi = INT_MAX) {
    uniform_int_distribution<int> rnd(lo, hi);
    return rnd(gen);
}

struct mint {
    int val;
    mint(int32_t x = 0) {
        val = x % mod;
    }
    mint(long long x) {
        val = x % mod;
    }
    mint operator+(mint x) {
        return val + x.val;
    }
    mint operator-(mint x) {
        return val - x.val + mod;
    }
    mint operator*(mint x) {
        return 1LL * val * x.val;
    }
    void operator+=(mint x) {
        val = (*this + x).val;
    }
    void operator-=(mint x) {
        val = (*this - x).val;
    }
    void operator*=(mint x) {
        val = (*this * x).val;
    }
    friend auto operator>>(istream& in, mint &x) -> istream& {
        in >> x.val;
        x.val %= mod;
        return in;
    }
    friend auto operator<<(ostream& out, mint const &x) -> ostream& {
        out << x.val;
        return out;
    }
};

int n, b[N], pref[N], suf[N], ans[N];
pii a[N];

int32_t main()
{
    cin.tie(nullptr)->sync_with_stdio(0);
    
    cin >> n;
    for(int i=1; i<=n+1; i++)
        cin >> a[i].fi, a[i].sc = 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; i++)
        pref[i] = max(pref[i-1], max(a[i].fi-b[i], 0));
    for(int i=n; i>=1; i--)
        suf[i] = max(suf[i+1], max(a[i+1].fi-b[i], 0));
    
    for(int i=1; i<=n+1; i++)
        ans[a[i].sc] = max(pref[i-1], suf[i]);
    for(int i=1; i<=n; i++)
        cout << ans[i] << ' ';
    return 0;
}

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