#include "shoes.h"
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 1e5 + 5;
ll ans, f, ol;
vector<pair<int, int>> v;
queue<int> l[N], r[N];
struct fenwick{
int bit[N];
void upd(int i, int x){
for(; i<N; i += i & -i) bit[i] += x;
}
ll qry(int i){
ll res = 0;
for(; i>0; i -= i & -i) res += bit[i];
return res;
}
}fw;
ll count_swaps(vector<int> s){
int n = s.size();
for(int i = 0;i<n;i++){
if(s[i] < 0){
if(!r[-s[i]].empty()) v.push_back({r[-s[i]].front(), i}), r[-s[i]].pop(), ++ans;
else l[-s[i]].push(i);
}else{
if(!l[s[i]].empty()) v.push_back({l[s[i]].front(), i}), l[s[i]].pop();
else r[s[i]].push(i);
}
}
sort(v.begin(), v.end());
for(int i = 0;i<v.size() - 1;i++){
if(v[i].second - v[i + 1].first > 0){
ans += v[i].second - v[i + 1].first;
}
}
ans += v.back().second - v.back().first - 1;
for(int i = v.size() - 1;i>=0;i--){
if(v[i].first + 1 == v[i].second) continue;
ol += (fw.qry(2 * n) - fw.qry(v[i].second));
fw.upd(v[i].second, 1);
}
return ans - ol;
}
