#include "shoes.h"
#include "bits/stdc++.h"
using namespace std;
#define int long long
const int MAX = 1e5;
vector<int> fenwick(MAX + 10);
void update(int n) {
for (; n <= MAX; n += n & -n) fenwick[n]++;
}
int query(int n) {
int S = 0;
for (; n > 0; n -= n & -n) S += fenwick[n];
return S;
}
int count_swaps(vector<signed> S) {
const int N = S.size();
vector<bool> done(N);
vector<int> A(N), B;
map<int, int> used;
map<int, vector<int> > memo;
for (int i = 0; i < N; i++) memo[S[i]].push_back(i);
int n = 0;
for (int i = 0; i < N; i++) {
if (done[i]) continue;
const int nxt = *lower_bound(memo[-S[i]].begin(), memo[-S[i]].end(), used[-S[i]]);
used[-S[i]] = nxt + 1;
if (S[i] > 0) A[i] = n + 1, A[nxt] = n;
else A[i] = n, A[nxt] = n + 1;
n += 2;
done[nxt] = 1;
}
int ans = 0;
B = A;
sort(B.begin(), B.end());
B.erase(unique(B.begin(), B.end()), B.end());
for (int i = 0; i < N; i++) {
A[i] = lower_bound(B.begin(), B.end(), A[i]) - B.begin();
ans += query(N - A[i]);
update(N - A[i]);
}
return ans;
}
