# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
532199 | andecaandeci | 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;
long long count_swaps(vector<int> s){
int n = s.size();
long long ans = 0;
for(int i=0;i<n;i+=2){
int j;
for(j = i+1;abs(s[j]) !+ abs(s[i]) || s[i] * s[j] > 0;++j){
if(s[j] != 0){
ans ++;
}
}
for(int k = j;k > i + 1;k--){
swap(s[k],s[k-1]);
}
if(s[i] > 0) ans++;
}
return ans;
}