Submission #821904

#	Time	Username	Problem	Language	Result	Execution time	Memory
821904		Nelt	Just Long Neckties (JOI20_ho_t1)	C++17	100 / 100	82 ms	15436 KiB

ho_t1

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,fma")

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

/* DEFINES */
#define S second
#define F first
#define ll long long
#define ull unsigned long long
#define ld long double
#define npos ULLONG_MAX
#define INF LLONG_MAX
#define vv(a) vector<a>
#define pp(a, b) pair<a, b>
#define pq(a) priority_queue<a>
#define qq(a) queue<a>
#define ss(a) set<a>
#define mm(a, b) map<a, b>
#define ump(a, b) unordered_map<a, b>
#define ANDROID                   \
    ios_base::sync_with_stdio(0); \
    cin.tie(0);                   \
    cout.tie(0);
#define elif else if
#define endl "\n"
#define allc(a) begin(a), end(a)
#define all(a) a, a + sizeof(a) / sizeof(a[0])
#define pb push_back
#define logi(a) __lg(a)
#define sqrt(a) sqrtl(a)
#define mpr make_pair
#define ins insert
using namespace std;
using namespace __gnu_pbds;
using namespace __cxx11;
typedef char chr;
typedef basic_string<chr> str;
template <typename T, typename key = less<T>>
using ordered_set = tree<T, null_type, key, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void solve()
{
    ll n;
    cin >> n;
    ll ans[n + 1], b[n];
    pp(ll, ll) a[n + 1];
    for (ll i = 0; i <= n; i++)
        cin >> a[i].F, a[i].S = i;
    for (ll i = 0; i < n; i++)
        cin >> b[i];
    sort(all(a));
    sort(all(b));
    ll pref[n], suf[n + 1];
    pref[0] = a[0].F - b[0];
    for (ll i = 1; i < n; i++)
        pref[i] = max(pref[i - 1], a[i].F - b[i]);
    suf[n] = a[n].F - b[n - 1];
    for (ll i = n - 1; i >= 1; i--)
        suf[i] = max(suf[i + 1], a[i].F - b[i - 1]);
    for (ll i = 0; i <= n; i++)
        ans[a[i].S] = max({0ll, i == 0 ? 0 : pref[i - 1], i == n ? 0 : suf[i + 1]});
    for (ll i = 0; i <= n; i++)
        cout << ans[i] << " \n"[i == n];
}
/*

*/
int main()
{
    ANDROID
    // precomp();
    ll t = 1;
    // cin >> t;
    for (ll i = 1; i <= t; i++)
        // cout << "Case #" << i << ": ",
        solve();
    cerr << "\nTime elapsed : " << clock() * 1000.0 / CLOCKS_PER_SEC << " ms\n";
}

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