#include<bits/stdc++.h>
#include "shoes.h"
using namespace std;
const int MAXN = 200005;
long long ok[MAXN] = {};
void upd(int idx, int val){
idx++;
while(idx<=MAXN){
ok[idx]+=val;
idx+=idx&(-idx);
}
}
long long get(int idx){
idx++;
long long s= 0;
while(idx>0){
s+=ok[idx];
idx-=idx&(-idx);
}
return s;
}
long long count_swaps(vector<int> v) {
long long ans = 0;
queue<int> p[MAXN][2]={};
for(int i = 0; i < v.size(); i++){
if(v[i]<0) p[-v[i]][0].push(i);
else{ p[v[i]][1].push(i);}
}
int es[2*MAXN] = {};
for(long long i = 0; i < v.size(); i++){
if(es[i]) continue;
int ratovervweramamocanas = 1;
if(v[i]<0) ratovervweramamocanas = 0;
long long j = p[abs(v[i])][1-ratovervweramamocanas].front();
p[abs(v[i])][0].pop();
p[abs(v[i])][1].pop();
ans+=j - i - 1;
ans-=(get(j)-get(i));
es[j] = 1;
upd(j, 1);
if(v[i]>0) ans++;
}
return ans;
}
