# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
232425 | jam_xd_ | Arranging Shoes (IOI19_shoes) | C++17 | 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 main()
{
int tamano;
cin>>tamano;
deque<int>s(tamano);
for(int i=0;i<tamano;i++){
cin>>s[i];
}
int contador=0;
int swaps = 0;
int aux;
for(int i=0;i<s.size();i++){
if((s[i] > 0 && i%2 == 0 && i!= 0) or (s[0] > 0 && i==0)){
for(int j=i;j<s.size();j++){
contador++;
if(s[j] < 0 && j%2==0){
swaps = swaps + contador;
aux = s[i];
s[i] = s[j];
s[j] = aux;
contador = 0;
break;
}
}
}
if(s[i] < 0 && i%2 != 0){
for(int k=i;k<s.size();k++){
contador++;
if(s[k] > 0 && k%2==0 && i!= 0){
swaps = swaps + contador;
aux = s[i];
s[i] = s[k];
s[k] = aux;
contador = 0;
break;
}
}
}
}
cout<<swaps<<endl;
return 0;
}