# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
895461 | ozner77 | 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 "shoes.h"
#include <bits/stdc++.h>
#include <vector>
#include <iostream>
#include <string>
using namespace std;
long long count_swaps(std::vector<int> s) {
int a,b,c,d;
long long swaps=0;
a=s[0];
b=s[0];
for(int k=0;k<s.size();k+=2){
a=s[k];
b=s[k];
for(int i=k;i<s.size();i++){
if(s[i]<0){
swaps++;
s[k]=s[i];
s[i]=a;
c=s[k+1];
d=s[k+1];
for(int j=k+1;j<s.size();j++){
if(s[j]+s[k]==0){
s[k+1]=s[j];
s[j]=c;
break;
}else if(i>=k+2){
d=s[j];
s[j]=c;
c=d;
}
}
break;
}else if(i>=k+1){
swaps++
b=s[i];
s[i]=a;
a=b;
}
}
}
return swaps;
}