#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include "shoes.h"
using namespace std;
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()
#define ll long long
#define ld long double
#define ui uint64_t
#define cont(set, element) ((set).find(element) != (set).end())
/********* DEBUG *********/
template <typename T>
void outvec(const vector<T>& Z){
for (const T& x : Z)
cout << x << ' ';
cout << "\n";
}
void printVariable(const any& var) {
if (!var.has_value()) {
cout << "null";
return;
}
if (var.type() == typeid(int)) {
cout << any_cast<int>(var);
} else if (var.type() == typeid(double)) {
cout << any_cast<double>(var);
} else if (var.type() == typeid(float)) {
cout << any_cast<float>(var);
} else if (var.type() == typeid(char)) {
cout << any_cast<char>(var);
} else if (var.type() == typeid(bool)) {
cout << (any_cast<bool>(var) ? "true" : "false");
} else if (var.type() == typeid(string)) {
cout << any_cast<string>(var);
} else if (var.type() == typeid(const char*)) {
cout << any_cast<const char*>(var);
} else if (var.type() == typeid(long long)) {
cout << any_cast<long long>(var);
} else {
cout << "[unknown type]";
}
}
template<typename... Args>
void outval(Args... args) {
vector<any> variables = {args...};
for (size_t i = 0; i < variables.size(); ++i) {
printVariable(variables[i]);
if (i != variables.size() - 1) {
cout << " ";
}
}
cout << "\n";
}
#define nl "\n"
#define sp << " " <<
/********* DEBUG *********/
const ll MOD = 1000000007;
const ll inf = 1e18;
const ll mxN = 100005;
struct fenwick {
vector<ll> bit;
ll n;
fenwick(ll sz){
n = sz;
bit.assign(n, 0);
}
fenwick(vector<ll> const &a) : fenwick(a.size()) {
for (size_t i = 0; i < a.size(); i++){
add(i, a[i]);
}
};
ll sum(ll r){
ll ans = 0;
for (; r >= 0; r = (r & (r + 1)) - 1)
ans += bit[r];
return ans;
}
ll rangesum(ll l, ll r){
return sum(r) - sum(l-1);
}
void add(ll idx, ll delta){
for (; idx < n; idx = idx | (idx + 1))
bit[idx] += delta;
}
};
long long count_swaps(vector<int> s) {
ll ans = 0, need = 0, n = s.size();
fenwick bit(n);
vector<vector<ll>> l(n/2+1), r(n/2+1);
vector<ll> ptrs(n/2+1, 0);
vector<bool> dn(n);
for (int i = 0; i < n; i++){
if (s[i] < 0){
l[abs(s[i])].push_back(i);
}
else{
r[s[i]].push_back(i);
}
}
for (int i = 0; i < n; i++){
if (dn[i])
continue;
ll ptr = ptrs[abs(s[i])];
ptrs[abs(s[i])]++;
if (s[i] < 0){
s[i] *= -1;
ll idl = l[s[i]][ptr], idr = r[s[i]][ptr];
dn[idr] = true;
ll xl = bit.sum(n-idl-1);
ll xr = bit.sum(n-idr-1);
bit.add(idl, 1);
idl += xl;
idr += xr;
ans += idr-idl-1;
}
else{
ll idl = l[s[i]][ptr], idr = r[s[i]][ptr];
dn[idl] = true;
ll xl = bit.sum(n-idl-1);
ll xr = bit.sum(n-idr-1);
bit.add(idr, 1);
idl += xl;
idr += xr;
ans += idl-idr;
}
}
return ans;
}
