| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 146769 | youssan_william | 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;
typedef long long ll;
bool v[100005];
int count_swaps(vector<ll>arr)
{
    ll n = arr.size();
    ll tmp;
    ll ans=0;
    for(int i = 1 ; i <=2*n ; i++)
    {
        if(!v[abs(arr[i])])
        {
            v[abs(arr[i])]=1;
            for(int j =i+1 ; j <= 2 * n ;j++)
            {
                if(abs(arr[i])==abs(arr[j]))
                {
                    for(int k=j-1 ; k>i ;k--)
                    {
                        //swap(arr[k],arr[k+1]);
                        tmp=arr[k];
                        arr[k]=arr[k+1];
                        arr[k+1]=tmp;
                        ans++;
                    }
                    break;
                }
            }
        }
    }
    for(int i = 1 ;  i <=2*n ;i++ )
    {
        if(i%2==1&&arr[i]>arr[i+1])
            ans++;
    }
    return ans;
}
