| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 197393 | Ahmed_Selim | 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 <cstring>
#include <vector>
#include <set>
#include <algorithm>
#define MOD 1000000007
using namespace std;
long long int cvp, n;
vector<int> konum[2][200010];
int64 count_swaps(int[] arr){
for (n = 0; arr[n] ; ++n){
if(arr[n]<0)konum[1][arr[n]].push_back(n);
else konum[0][arr[n]].push_back(n);
}
for (int i = 0; i < n; i+=2){
if(arr[i]<0){
int j=0;
while(konum[0][arr[i]][j]<0)j++;
int index=konum[0][arr[i]][j];
while(index!=i+1){
swap(arr[index], arr[index-1]);
cvp++;
}
konum[0][arr[i]][j]=-1;
}else{
int j=0;
while(konum[0][arr[i]][j]<0)j++;
int index=konum[0][arr[i]][j];
while(index!=i+1){
swap(arr[index], arr[index-1]);
cvp++;
}
konum[0][arr[i]][j]=-1;
cvp++;
}
}
return cvp;
}