Submission #1255202

#	Time	Username	Problem	Language	Result	Execution time	Memory
1255202		VMaksimoski008	Bubble Sort 2 (JOI18_bubblesort2)	C++17	100 / 100	1758 ms	84720 KiB

bubblesort2

#include "bubblesort2.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;

struct segment_tree {
    int n;
    vector<ll> tree, lazy;

    segment_tree(int _n) : n(_n), tree(4*n), lazy(4*n) {}

    void push(int u, int tl, int tr) {
        if(!lazy[u]) return ;
        tree[u] += lazy[u];

        if(tl != tr) {
            lazy[2*u] += lazy[u];
            lazy[2*u+1] += lazy[u];
        }

        lazy[u] = 0;
    }

    void update(int u, int tl, int tr, int l, int r, int v) {
        push(u, tl, tr);
        if(tl > r || l > tr) return ;

        if(l <= tl && tr <= r) {
            lazy[u] += v;
            push(u, tl, tr);
            return ;
        }

        int tm = (tl + tr) / 2;
        update(2*u, tl, tm, l, r, v);
        update(2*u+1, tm+1, tr, l, r, v);
        tree[u] = max( tree[2*u], tree[2*u+1] );
    }

    ll query(int u, int tl, int tr, int l, int r) {
        if(tl > r || l > tr) return -1e9;
        push(u, tl, tr);
        if(l <= tl && tr <= r) return tree[u];
        int tm = (tl + tr) / 2;
        return max( query(2*u, tl, tm, l, r), query(2*u+1, tm+1, tr, l, r) );
    }

    void update(int l, int r, int v) { update(1, 0, n-1, l, r, v); }
    ll query(int l, int r) { return query(1, 0, n-1, l, r); }
};

vector<int> countScans(vector<int> A, vector<int> X, vector<int> V){
	int q = X.size();
    int n = A.size();
    vector<int> ans(q);

    vector<pair<int, int> > ord;
    for(int i=0; i<n; i++) ord.push_back({ A[i], i });
    for(int i=0; i<q; i++) ord.push_back({ V[i], X[i] });
    sort(ord.begin(), ord.end());

    int m = ord.size();
    segment_tree sgt(m);

    for(int i=0; i<n; i++) {
        int p = lower_bound(ord.begin(), ord.end(), pii{ A[i], i }) - ord.begin();
        sgt.update(p, p, i);
        sgt.update(p+1, m-1, -1);
    }

    for(int i=0; i<q; i++) {
        int p = lower_bound(ord.begin(), ord.end(), pii{ A[X[i]], X[i] }) - ord.begin();
        sgt.update(p, p, -X[i]);
        sgt.update(p+1, m-1, 1);

        A[X[i]] = V[i];

        p = lower_bound(ord.begin(), ord.end(), pii{ A[X[i]], X[i] }) - ord.begin();
        sgt.update(p, p, X[i]);
        sgt.update(p+1, m-1, -1);

        sgt.push(1, 0, m-1);
        ans[i] = sgt.tree[1];
    }

    return ans;
}

• Subtask 1: 17 / 17
• Subtask 2: 21 / 21
• Subtask 3: 22 / 22
• Subtask 4: 40 / 40