# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
474108 | ValiAntonie | 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 "shoes.h"
#include<bits/stdc++.h>
using namespace std;
long long count_swaps(vector<int> v){
int indice = -1;
int v[100001];
int i = 0, nr = 0, numar = 0, j = 0, j2 = 0, nr2;
int n = v.size();
for(i=0;i<n;i++)
v2[i] = v[i];
for(i=0;i<n;i++){
if(v2[i] > 0 && v2[i+1] < 0){
swap(v2[i],v2[i+1]);
nr2++;
}
}
for(i=0;i<n;i++){
if(v2[i] != -v2[i+1] && v2[i+1] != -v2[i+2] && v2[i] > 0){
swap(v2[i],v2[i+1]);
nr2++;
}
}
for(i=indice;i<n;i++){
if(v[i] < 0){
indice++;
numar = -v[i];
for(j=i;j>indice;j--){
swap(v[j],v[j-1]);
nr++;
}
indice++;
for(j2=1;j2<n;j2++){
if(v[j2] == numar){
for(j=i;j>indice;j--){
swap(v[j],v[j-1]);
nr++;
}
}
}
i = indice;
}
}
return min(nr,nr2);
}