#include "shoes.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
queue <int> qu1[100050];//positive
queue <int> qu2[100050];//negative, store as positive
long long count_swaps(std::vector<int> s) {
ll si = s.size();
//cout << si << "\n";
ll ans = 0;
for (ll i=0; i<si; i++){
//cout << i << ' ';
if(s[i] > 0){
if(!qu2[s[i]].size()){
qu1[s[i]].push(i);
}else{
ans += i - qu2[s[i]].front() - 1;
qu2[s[i]].pop();
}
}else{
s[i] *= -1;
if(!qu1[s[i]].size()){
qu2[s[i]].push(i);
}else{
ans += i - qu1[s[i]].front();
qu1[s[i]].pop();
}
}
//cout << "E";
}
return ans;
}
