Submission #1279505

#	Time	Username	Problem	Language	Result	Execution time	Memory
1279505		friendiks	Just Long Neckties (JOI20_ho_t1)	C++20	0 / 100	1 ms	332 KiB

ho_t1

#ifndef LOCAL
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC diagnostic ignored "-Wpedantic"
#endif

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

using namespace std;
using namespace __gnu_pbds;

auto seed = chrono::high_resolution_clock::now().time_since_epoch().count();
mt19937 rnd(seed);
template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename V>
using table = gp_hash_table<T, V>;

using i128 = __int128;
using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;

const ll INF = 1e13;
const int inf = 1e9;
const int maxk = 140;
const int MOD = 1e9 + 7;
const double pi = acos(-1);
const int P = 5167;
const int L = 26;
const ld EPS = 1e-7;
const int W = 3;
const int MBIT = 18;
const int maxn = 2e5 + 7;
const int B = 550;

template<typename T, typename V>
void fill(T &container, V value) {
    for (auto &c : container)
        c = value;
}

# define int ll

void solve() {
    int n;
    cin >> n;
    vector<int> A(n + 1), B(n);
    for (int i = 0; i <= n; ++i) cin >> A[i];
    for (int i = 0; i < n; ++i) cin >> B[i];
    map<int, int> mp;
    vector<int> a = A, b = B;
    sort(a.begin(), a.end());
    sort(b.begin(), b.end());
    multiset<int> st;
    for (int i = 0; i < n; ++i) st.insert(a[i + 1] - b[i]);
    mp[a[0]] = *st.rbegin();
    for (int i = 1; i <= n; ++i) {
        st.erase(st.lower_bound(a[i] - b[i - 1]));
        st.insert(a[i - 1] - b[i - 1]);
        mp[a[i]] = *st.rbegin();
    }
    for (int i = 0; i <= n; ++i) cout << max(0ll, mp[a[i]]) << " ";
}

signed main() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(9);
    int t = 1;
    //cin >> t;
    while (t--) solve();
#ifdef LOCAL
    cout << "\n\n\n=====================================================\nProgram worked for: ";
    cout << (ld) clock() / CLOCKS_PER_SEC << "s";
#endif
    //stress();
}

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