# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1242556 | mohamedboukerche55 | Arranging Shoes (IOI19_shoes) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
using namespace std;
long long count_swaps(vector<int>& S)
{
int n = S.size();
vector<int> lf, ri;
for (int i = 0; i < n; i++)
{
if (S[i] > 0)
{
lf.push_back(i);
}
else ri.push_back(i);
}
long long count = 0;
int m = lf.size();
int l = 0, r = 0;
while (l < m && r < m)
{
if (S[lf[l]] == -S[ri[r]])
{
count += abs(lf[l] - ri[r]);
l++, r++;
} else if (lf[l] < ri[r])
{
l++;
}
else
{
r++;
}
}
return count;
}
/*int main() {
int n;
assert(1 == scanf("%d", &n));
vector<int> S(2 * n);
for (int i = 0; i < 2 * n; i++)
assert(1 == scanf("%d", &S[i]));
fclose(stdin);
long long result = count_swaps(S);
printf("%lld\n", result);
fclose(stdout);
return 0;
}*/