| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 248836 | egekabas | Bubble Sort 2 (JOI18_bubblesort2) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pull;
typedef pair<ll, ll> pii;
typedef pair<ld, ld> pld;
ll seg[4000009];
ll lazy[4000009];
void push(ll v){
lazy[2*v] += lazy[v];
lazy[2*v+1] += lazy[v];
seg[2*v] += lazy[v];
seg[2*v+1] += lazy[v];
lazy[v] = 0;
}
void upd(ll v, ll tl, ll tr, ll l, ll r, ll val){
if(r < tl || tr < l) return;
if(l <= tl && tr <= r){
seg[v] += val;
lazy[v] += val;
}
else{
push(v);
upd(2*v, tl, (tl+tr)/2, l, r, val);
upd(2*v+1, (tl+tr)/2+1, tr, l, r, val);
seg[v] = max(seg[2*v], seg[2*v+1]);
}
}
vector<ll> mpp;
ll get(ll x){
return lower_bound(mpp.begin(), mpp.end(), x)-mpp.begin();
}
set<ll, greater<ll>> s[1000009];
ll n, N;
void erase(ll idx, vector<ll> &a){
if(*s[a[idx]].begin() == idx+1){
upd(1, 0, N, a[idx], a[idx], -(idx+1));
s[a[idx]].erase(idx+1);
if(s[a[idx]].size())
upd(1, 0, N, a[idx], a[idx], *s[a[idx]].begin());
}
else
s[a[idx]].erase(idx+1);
upd(1, 0, N, a[idx], N, 1);
}
void add(ll idx, vector<ll> &a){
if(idx+1 > *s[a[idx]].begin()){
upd(1, 0, N, a[idx], a[idx], -*s[a[idx]].begin());
upd(1, 0, N, a[idx], a[idx], (idx+1));
}
s[a[idx]].insert(idx+1);
upd(1, 0, N, a[idx], N, -1);
}
vector<ll> countScans(vector<ll> a, vector<ll> x, vector<ll> v){
n = a.size();
for(auto u : a)
mpp.pb(u);
for(auto u : v)
mpp.pb(u);
sort(mpp.begin(), mpp.end());
mpp.resize(unique(mpp.begin(), mpp.end())-mpp.begin());
N = mpp.size()-1;
for(auto &u : a)
u = get(u);
for(auto &u : v)
u = get(u);
for(ll i = 0; i < n; ++i){
s[a[i]].insert(i+1);
upd(1, 0, N, a[i], n, -1);
}
for(ll i = 0; i < n; ++i)
if(*s[a[i]].begin() == i+1){
upd(1, 0, N, a[i], a[i], i+1);
}
vector<ll> ans(x.size());
for(ll i = 0; i < x.size(); ++i){
erase(x[i], a);
a[x[i]] = v[i];
add(x[i], a);
ans[i] = max(seg[1], 0);
}
return ans;
}