#include "shoes.h"
#include <bits/stdc++.h>
using namespace std;
const int MX = 2e5 + 5;
int N;
long long a[MX];
void add(int ind, int x)
{
while(ind <= 2 * N)
{
a[ind] += x;
ind += ind & -ind;
}
}
long long get(int ind)
{
int r = 0;
while(ind > 0)
{
r += a[ind];
ind -= ind & -ind;
}
return r;
}
long long count_swaps(vector<int> s) {
N = s.size() / 2;
queue<int> p[N + 1], n[N + 1];
for(int i = 0; i < N * 2; i++)
{
if(s[i] > 0)p[s[i]].push(i + 1);
else n[-s[i]].push(i + 1);
}
int used[N * 2 + 1] = {0};
long long ans = 0;
for(int i = 0; i < N; i++)
{
if(used[i + 1])continue;
int x = p[abs(s[i])].front();
int y = n[abs(s[i])].front();
p[abs(s[i])].pop();
n[abs(s[i])].pop();
if(s[i] > 0)
{
ans += y - x - (get(y) - get(x));
add(y, 1);
}
else
{
ans += x - y - (get(x) - get(y)) - 1;
add(x, 1);
}
used[y] = 1;
used[x] = 1;
}
return ans;
}
