# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
285662 | Otaku619 | 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 <bits/stdc++.h>
using namespace std;
int count_swaps(int v[], int n)
{
int swa = 0;
for (int i = 0; i < 2 * n; i += 2)
{
for (int j = i + 1; j < 2 * n; j++)
{
if (abs(v[j]) == abs(v[i]))
{
for (int k = j; k > i + 1; k--)
swap(v[k], v[k - 1]);
swa += (j - 1 - i);
if (v[i + 1] < 0)
{
swap(v[i], v[i + 1]);
swa++;
}
break;
}
}
}
return swa;
}
int main()
{
int n;
cin >> n;
int vect[2 * n];
for (int i = 0; i < 2 * n; i++)
{
int j;
cin >> j;
vect[i] = j;
}
// for(int i=0;i<2*n;i++)
// cout<<vect[i];
cout << count_swaps(vect, n);
return 0;
}