Submission #1094756

#	Time	Username	Problem	Language	Result	Execution time	Memory
1094756		stefanopulos	Just Long Neckties (JOI20_ho_t1)	C++17	100 / 100	85 ms	10064 KiB

ho_t1

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
 
using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ldb;
 
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ldb,ldb> pdd;
 
#define ff(i,a,b) for(int i = a; i <= b; i++)
#define fb(i,b,a) for(int i = b; i >= a; i--)
#define trav(a,x) for (auto& a : x)
 
#define sz(a) (int)(a).size()
#define pb push_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

// os.order_of_key(k) the number of elements in the os less than k
// *os.find_by_order(k)  print the k-th smallest number in os(0-based)

const int mod = 1000000007;
const int inf = 1e9 + 5;
const int mxN = 200005; 

int n;
pii A[mxN];
int B[mxN];

int res[mxN];
int sufi[mxN];

int main() {
    cin.tie(0)->sync_with_stdio(0);

    cin >> n;
    ff(i,1,n + 1)cin >> A[i].fi, A[i].se = i;
    ff(i,1,n)cin >> B[i];

    sort(A + 1, A + n + 2);
    sort(B + 1, B + n + 1);

    fb(i,n + 1,2)sufi[i] = max({sufi[i + 1], A[i].fi - B[i - 1], 0});

    res[A[1].se] = sufi[2]; int mx = 0;
    ff(i,1,n){
        mx = max({mx, A[i].fi - B[i], 0});
        res[A[i + 1].se] = max(mx, sufi[i + 2]);
    }

    ff(i,1,n + 1)cout << res[i] << " ";
    cout << '\n';

    return 0;
}
/*
 
3
4 3 7 6
2 6 4

5
4 7 9 10 11 12
3 5 7 9 11
 
// probati bojenje sahovski
*/
 
 
 
 
 

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