# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
994319 | cpdreamer | 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.
long long count_swaps(vector<int> s) {
int n=(int)s.size();
long long c=0;
for(int i=0;i<n-1;i+=2){
if(-s[i]==s[i+1]){
if(s[i]>0) {
swap(s[i], s[i + 1]);
c++;
}
}
else{
int index;
for(int j=i+1;j<n;j++){
if(s[j]==-s[i]){
index=j;
break;
}
}
for(int j=index;j>i+1;j--){
swap(s[j],s[j-1]);
c++;
}
if(s[i]>0){
swap(s[i],s[i+1]);
c++;
}
}
}
return c;
}