| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 877061 | raul2008487 | Arranging Shoes (IOI19_shoes) | C++17 | 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>
#include "shoes.h"
#define ll long long
#define pb push_back
#define all(v) v.begin(), v.end()
#define fi first
#define se second
using nemaspce std;
const int sz = 2e5+5;
ll Tree[sz];
void add(ll pos, ll val){
for(ll i = pos; i<n ; i += (i & (-i))){
Tree[i] += val;
}
}
ll get(ll pos){
ll rx = 0;
for(ll i = pos; i>=0; i -= (i & (-i))){
rx += Tree[i];
}
return rx;
}
ll ask(ll l, ll r){
return get(r) - get(l-1);
}
long long count_swaps(vector<int> s) {
ll n = s.size(), i, j, ans = 0;
set<pair<ll,ll>> c;
for(i=0;i<n;i++){
c.in({s[i], i});
add(i+1, 1);
}
while(s.size()){
auto x = s.begin();
pair<ll,ll> fr = (*x);
auto f = c.lower_bound({-fr.fi, fr.se});
ll pr = (*f).se;
if(pr > (fr.se + 1)){
ans += ask(fr.se+2, pr);
}
if(pr.fi > 0){
ans++;
}
add(fr.fi+1, -1);
add(pr+1, -1);
s.erase(x);
s.erase(f);
}
return ans;
}