# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1235189 | rhm_gan | Arranging Shoes (IOI19_shoes) | C++20 | 0 ms | 0 KiB |
#include "shoes.h"
#include <bits/stdc++.h>
using namespace std;
int64_t count_swaps(vector<int> a) {
int n = a.size();
int64_t res = 0;
for (int i = 0; i < n; i += 2) {
int id = 0;
for (int j = i + 1; j < n; j++) {
if (-a[j] == a[i]) {
id = j;
break;
}
}
res += id - i - 1;
for (int j = id - 1; j > i; j--) {
swap(a[j], a[j + 1]);
}
if (a[i] > 0) {
res++;
swap(a[i], a[i + 1]);
}
}
return res;
}