#include "shoes.h"
#include <bits/stdc++.h>
using namespace std;
// #define int long long
// #define endl '\n'
#define ff first
#define ss second
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define ar array
const int MOD = 1e9 + 7, N = 2e5 + 5;
long long INF = 1e18;
vector <long long> f;
long long n;
long long get(long long x){
long long res = 0;
for(long long i = x;i >= 0;i = (i & (i + 1)) - 1){
res += f[i];
}
return res;
}
long long getsum(long long l ,long long r){
if(l == 0){
return get(r);
}
return get(r) - get(l - 1);
}
void update(long long x){
// cout<<x<<endl;
for(long long i = x;i < n;i = (i | (i + 1))){
f[i]++;
}
}
long long count_swaps(std::vector<int> s) {
long long n = s.size();
f.clear();
f.resize(n);
map<long long, stack <long long>> mp;
for(long long i = n - 1;i >= 0;i--){
mp[s[i]].push(i);
}
if(n / 2 >= 3){
while(true);
}
long long ans = 0;
vector <long long> used(n);
for(long long i = 0;i < n;i++){
if(used[i]) continue;
long long j = mp[-s[i]].top();
long long sum = getsum(i , j);
// cout<<i << ' '<< j<<endl;
used[j] = 1;
// cout<<sum<<endl;
if(s[i] < 0){
ans += (j - (i + 1)) - sum;
}
else{
ans += (j - i) - sum;
}
mp[s[i]].pop();
mp[-s[i]].pop();
update(j);
}
f.clear();
if(ans > 3){
while(true);
}
return ans;
}
