# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
888548 | Lincito_31 | 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.
using namespace std;
#include <bits/stdc++.h>
#include "shoes.h"
long long x;
int64_t count_swaps(vector<int> s) {
//x=s.size();
//x/=2;
/*if(x==1){
return s[0]<0?0:1;
}else{
x=x*(x-1)/2;
return x;
*/
while(!s.empty()){
long long i=0;
while(s[i]>0){
i++;
}
x+=i;
long long abso=-1*s[i];
vector<int> ant(s.begin(),s.begin()+i);
vector<int> pos(s.begin()+i+1,s.end());
ant.insert(ant.end(),pos.begin(),pos.end());
s=ant;
i=0;
while(s[i]!=abso){
i++;
}
x+=i;
vector<int> ante(s.begin(),s.begin()+i);
vector<int> post(s.begin()+i+1,s.end());
ante.insert(ante.end(),post.begin(),post.end());
s=ante;
}
return x;
}