Submission #890465

#	Time	Username	Problem	Language	Result	Execution time	Memory
890465		hafo	Just Long Neckties (JOI20_ho_t1)	C++14	100 / 100	90 ms	12368 KiB

ho_t1

#include <bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define pb push_back
#define pa pair<int, int>
#define pall pair<ll, int>
#define fi first
#define se second
#define TASK "test"
#define Size(x) (int) x.size()
#define all(x) x.begin(), x.end()
using namespace std;

template<typename T1, typename T2> bool mini (T1 &a, T2 b) {if(a > b) a = b; else return 0; return 1;}
template<typename T1, typename T2> bool maxi (T1 &a, T2 b) {if(a < b) a = b; else return 0; return 1;}

const int MOD = 1e9 + 7;
const int LOG = 20;
const int maxn = 2e5 + 7;
const ll oo = 1e18 + 69;

int n, b[maxn], res[maxn];
pa a[maxn];

struct ST {
    struct node {
        int mx;
        friend node operator + (node a, const node &b) {
            maxi(a.mx, b.mx);
            return a;
        }
    };

    node st[4 * maxn];

    void build(int id, int l, int r) {
        if(l == r) {
            st[id].mx = max(0, a[l + 1].fi - b[l]);
            return;
        }
        int mid = l + r >> 1;
        build(id << 1, l, mid);
        build(id << 1 | 1, mid + 1, r);
        st[id] = st[id << 1] + st[id << 1 | 1];
    }

    void update(int id, int l, int r, int pos, int val) {
        if(pos < l || pos > r) return;
        if(l == r) {
            st[id].mx = val;
            return;
        }
        int mid = l + r >> 1;
        update(id << 1, l, mid, pos, val);
        update(id << 1 | 1, mid + 1, r, pos, val);
        st[id] = st[id << 1] + st[id << 1 | 1];
    }


} st;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    //freopen(TASK".inp", "r", stdin);
    //freopen(TASK".out", "w", stdout);

    cin>>n;
    for(int i = 1; i <= n + 1; i++) {
        cin>>a[i].fi;
        a[i].se = i;
    }
    for(int i = 1; i <= n; i++) cin>>b[i];

    sort(a + 1, a + 1 + n + 1);
    sort(b + 1, b + 1 + n);

    st.build(1, 1, n);
    res[a[1].se] = st.st[1].mx;
    for(int i = 1; i <= n; i++) {
        st.update(1, 1, n, i, max(0, a[i].fi - b[i]));
        res[a[i + 1].se] = st.st[1].mx;
    }
    for(int i = 1; i <= n + 1; i++) cout<<res[i]<<" ";
    return 0;
}

Compilation message (stderr)

ho_t1.cpp: In member function 'void ST::build(int, int, int)':
ho_t1.cpp:41:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   41 |         int mid = l + r >> 1;
      |                   ~~^~~
ho_t1.cpp: In member function 'void ST::update(int, int, int, int, int)':
ho_t1.cpp:53:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   53 |         int mid = l + r >> 1;
      |                   ~~^~~

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