Submission #761841

#	Time	Username	Problem	Language	Result	Execution time	Memory
761841		sysia	Just Long Neckties (JOI20_ho_t1)	C++17	100 / 100	84 ms	15484 KiB

ho_t1

//Sylwia Sapkowska
#include <bits/stdc++.h>
#pragma GCC optimize("O3", "unroll-loops")
using namespace std;

void __print(int x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << "'" << x << "'";}
void __print(const char *x) {cerr << '"' << x << '"';}
void __print(const string &x) {cerr << '"' << x << '"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef LOCAL
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif

#define int long long
typedef pair<int, int> T;
const int oo = 1e18, oo2 = 1e9+7, K = 30;
const int mod = 998244353;

void solve(){
    int n; cin >> n;
    vector<T>a(n+1);
    for (int i = 0; i<=n; i++) {
        cin >> a[i].first;
        a[i].second = i;
    }
    vector<int>b(n);
    for (auto &x: b) cin >> x;
    sort(a.begin(), a.end());
    sort(b.begin(), b.end());
    debug(a);
    debug(b);
    vector<int>pref(n+1), suf(n+2);
    for (int i = 0; i<n; i++){
        pref[i] = max((i ? pref[i-1] : 0), max(a[i].first - b[i], 0ll));
    }
    for (int i = n; i>0; i--){
        suf[i] = max((i == n ? 0 : suf[i+1]), max(a[i].first - b[i-1], 0ll));
    }
    debug(pref);
    debug(suf);
    vector<int>ans(n+1);
    for (int i = 0; i<=n; i++){
        ans[a[i].second] = max((i ? pref[i-1] : 0ll), suf[i+1]);
    }
    for (int i = 0; i<=n; i++) cout << ans[i] << " ";
    cout << "\n";
}

int32_t main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int t = 1;
    //cin >> t;
    while (t--) solve();

    return 0;
}

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