# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
523826 | pakhomovee | 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"
long long count_swaps(std::vector<int> s) {
int ans = 0;
for (int i = 0; i < n; ++i) {
int j;
for (j = i + 1; abs(s[j]) != abs(s[i]); ++j) {
if (s[j] != 0) {
++ans;
}
}
if (s[i] > 0) {
++ans;
}
s[i] = s[j] = 0;
}
return ans;
}