Submission #1095511

#	Time	Username	Problem	Language	Result	Execution time	Memory
1095511		thangdz2k7	Bubble Sort 2 (JOI18_bubblesort2)	C++17	100 / 100	1269 ms	55304 KiB

bubblesort2

#include <bits/stdc++.h>
#define pb push_back

using namespace std;
using ii = pair <int, int>;
using vi = vector <int>;

const int N = 4e6 + 5;

int mx, lz[N], Max[N];
const int inf = 4e6;

void update(int u, int v, int val, int s = 1, int l = 0, int r = mx - 1){
    if (u <= l && r <= v){
        Max[s] += val, lz[s] += val;
        return;
    }

    int mid = l + r >> 1;
    if (mid >= u) update(u, v, val, s << 1, l, mid);
    if (mid < v) update(u, v, val, s << 1 | 1, mid + 1, r);
    Max[s] = max(Max[s << 1], Max[s << 1 | 1]) + lz[s];
}

vi countScans(vi a, vi x, vi y){
    int n = a.size(), q = x.size(); vector <ii> sr;

    #define all(x) (x).begin(), (x).end()
    #define fd(sr, x) (lower_bound(sr.begin(), sr.end(), x) - sr.begin())
    #define uq(sr) (sr).erase(unique(all((sr))), (sr).end())
    #define szv(v) (int((v).size()))

    for (int i = 0; i < n; ++ i) sr.pb({a[i], i});
    for (int i = 0; i < q; ++ i) sr.pb({y[i], x[i]});
    sort(all(sr)); uq(sr); mx = szv(sr);
    for (int i = 1; i <= 4 * mx; ++ i) Max[i] = -inf, lz[i] = 0;

    auto fix = [&](int i, int f) -> void {
        ii x = {a[i], i}; int T = fd(sr, x);
        update(T, T, f * (inf + i));
        update(T, mx - 1, -f);
    };

    vi ans;
    for (int i = 0; i < n; ++ i) fix(i, 1);
    for (int i = 0; i < q; ++ i){
        fix(x[i], -1); a[x[i]] = y[i];
        fix(x[i], 1); ans.pb(Max[1] + 1);
    }
    return ans;
}

Compilation message (stderr)

bubblesort2.cpp: In function 'void update(int, int, int, int, int, int)':
bubblesort2.cpp:19:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   19 |     int mid = l + r >> 1;
      |               ~~^~~

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