Submission #758543

#	Time	Username	Problem	Language	Result	Execution time	Memory
758543		Hanksburger	Bubble Sort 2 (JOI18_bubblesort2)	C++17	100 / 100	2308 ms	40596 KiB

bubblesort2

#include "bubblesort2.h"
#include <bits/stdc++.h>
using namespace std;
int seg[4000005], lazy[4000005];
vector<pair<int, int> > vec;
vector<int> ans;
void push(int i, int l, int r)
{
    if (l==r)
    {
        seg[i]+=lazy[i];
        lazy[i]=0;
        return;
    }
    seg[i]+=lazy[i];
    lazy[i*2]+=lazy[i];
    lazy[i*2+1]+=lazy[i];
    lazy[i]=0;
}
void upd(int i, int l, int r, int ql, int qr, int val)
{
    if (ql<=l && r<=qr)
    {
        lazy[i]+=val;
        push(i, l, r);
        return;
    }
    int mid=(l+r)/2;
    push(i*2, l, mid);
    push(i*2+1, mid+1, r);
    if (ql<=mid && l<=qr)
        upd(i*2, l, mid, ql, qr, val);
    if (ql<=r && mid+1<=qr)
        upd(i*2+1, mid+1, r, ql, qr, val);
    seg[i]=max(seg[i*2], seg[i*2+1]);
}
vector<int> countScans(vector<int> a, vector<int> x, vector<int> y)
{
    int n=a.size(), m=x.size();
    for (int i=0; i<n; i++)
        vec.push_back({a[i], i});
    for (int i=0; i<m; i++)
        vec.push_back({y[i], x[i]});
    sort(vec.begin(), vec.end());
    vec.erase(unique(vec.begin(), vec.end()), vec.end());
    int sz=vec.size();
    for (int i=0; i<n; i++)
    {
        int ind=lower_bound(vec.begin(), vec.end(), make_pair(a[i], i))-vec.begin();
        int ind2=lower_bound(vec.begin(), vec.end(), make_pair(a[i], 0))-vec.begin();
        upd(1, 0, sz-1, ind, ind, i+1);
        upd(1, 0, sz-1, ind2, sz-1, -1);
    }
    for (int i=0; i<m; i++)
    {
        int ind=lower_bound(vec.begin(), vec.end(), make_pair(a[x[i]], x[i]))-vec.begin();
        int ind2=lower_bound(vec.begin(), vec.end(), make_pair(a[x[i]], 0))-vec.begin();
        upd(1, 0, sz-1, ind, ind, -x[i]-1);
        upd(1, 0, sz-1, ind2, sz-1, 1);
        a[x[i]]=y[i];
        ind=lower_bound(vec.begin(), vec.end(), make_pair(a[x[i]], x[i]))-vec.begin();
        ind2=lower_bound(vec.begin(), vec.end(), make_pair(a[x[i]], 0))-vec.begin();
        upd(1, 0, sz-1, ind, ind, x[i]+1);
        upd(1, 0, sz-1, ind2, sz-1, -1);
        ans.push_back(seg[1]);
    }
    return ans;
}

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