# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
537309 | ERH | Arranging Shoes (IOI19_shoes) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <vector>
using namespace std;
vector<int> lista[100001][2];
int temp[100001];
long long count_swaps(vector<int> v){
long long int total=0;
for(int i=0; i<v.size(); ++i){
int a=v[i];
if(a<0){
a=-a;
if(!lista[a][0].empty()){
int temp1=i+1, temp2=lista[a][0].front();
for(int j=i+1; j>0; j-=j&-j){
temp1+=temp[j];
}
temp1+=temp[0];
for(int j=lista[a][0].front(); j>0; j-=j&-j){
temp2+=temp[j];
}
temp2+=temp[0];
total+=temp1-temp2;
for(int j=lista[a][0].front(); j<100001; j+=j&-j){
temp[j]++;
}
for(int j=i+1; j<100001; j+=j&-j){
temp[j]--;
}
lista[a][0].erase(lista[a][0].begin());
} else {
lista[a][1].push_back(i+1);
}
} else {
if(!lista[a][1].empty()){
int temp1=i+1, temp2=lista[a][1].front();
for(int j=i+1; j>0; j-=j&-j){
temp1+=temp[j];
}
temp1+=temp[0];
for(int j=lista[a][1].front(); j>0; j-=j&-j){
temp2+=temp[j];
}
temp2+=temp[0];
total+=temp1-temp2;
total--;
for(int j=lista[a][1].front(); j<100001; j+=j&-j){
temp[j]++;
}
for(int j=i+1; j<100001; j+=j&-j){
temp[j]--;
}
lista[a][1].erase(lista[a][1].begin());
} else {
lista[a][0].push_back(i+1);
}
}
}
return total;
}
int main(){
cout<<count_swaps({2, 2, -2, -2});
}