| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1311346 | putuputu | Arranging Shoes (IOI19_shoes) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
int64 count_swaps(vector<int>a){
int m=2*a.size();
int swap=0;
for(int pos=0; pos<m; pos+=2){
if(a[pos]>0){
int nl=-a[pos];
int j=pos+1;
while(j<m and a[j]!=nl){
j++;
}
while(j>pos){
swap(a[j], a[j-1]);
j--;
swap++;
}
}
int nr=-a[pos];
int j = pos + 1;
while(j<m and a[j]!=nr){
j++;
}
while(j>pos+1){
swap(a[j], a[j-1]);
j--;
swap++;
}
}
return swap;
}
