| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 526048 | benjaminkleyn | 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 n = s.size() / 2;
if (n == 1) return (s[0] > 0);
bool samesize = true;
for (int i = 0; i < 2 * n; i++)
if (s[i] != s[0])
{
samesize = false;
break;
}
if (samesize)
{
std::vector<int> lefts;
for (int i = 0; i < 2 * n; i++)
if (s[i] < 0) lefts.push_back(i);
int res = 0;
for (int i = 0; i < n; i++)
res += std::abs(lefts[i] - i * 2);
return res;
}
return 1;
}
