#include "shoes.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define F first
#define S second
#define enter cout<<'\n';
#define INF 99999999999999999
#define MOD 1000000007
#define all(x) x.begin(),x.end()
ll seg[6000001];
void update (int pos,int l,int r,int idx,int u)
{
if(pos<l || pos>r)
return ;
if(l==r)
{
seg[idx]=u;
return ;
}
update(pos,l,(l+r)/2,idx*2,u);
update(pos,(l+r)/2+1,r,idx*2+1,u);
seg[idx]=seg[idx*2]+seg[idx*2+1];
}
ll query(int L,int R,int l,int r,int idx)
{
if(L>r || R<l)
return 0;
if(L<=l && r<=R)
return seg[idx];
return query(L,R,(l+r)/2+1,r,idx*2+1)+query(L,R,l,(l+r)/2,idx*2);
}
long long count_swaps(vector<int>s)
{
ll nn=s.size();
map<int,vector<int>>mp;
for(int i=0;i<nn;i++)
mp[s[i]].pb(i);
vector<pair<int,pair<int,int>>>g;
vector<int>answ(nn);
for(int j=1;j<=nn;j++)
{
if(mp[j].empty())
continue;
auto x=mp[-j],y=mp[j];
for(int i=0;i<x.size();i++)
g.pb({x[i]+y[i],{x[i],y[i]}});
}
sort(all(g));
ll idx=0;
for(auto x:g)
{
answ[x.S.F]=idx++;
answ[x.S.S]=idx++;
}
ll ans=0;
for(int i=0;i<nn;i++)
{
ans+=query(answ[i],nn-1,0,nn-1,1);
update(answ[i],0,nn-1,1,1);
}
return ans;
}
