| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1292562 | lukaye_19 | Arranging Shoes (IOI19_shoes) | C++20 | 0 ms | 0 KiB |
long long count_swaps(vector<int> Shoes) {
long long Answer = 0;
while (Shoes.size() != 0)
{
int FirstShoe = Shoes[0];
int ShoeIndex = -1;
for (int i = 1; i < Shoes.size(); i++) {
if (Shoes[i] == -FirstShoe)
{
ShoeIndex = i;
break;
}
}
if (FirstShoe > 0) {
Answer += (ShoeIndex - 1);
while (ShoeIndex > 1) {
swap(Shoes[ShoeIndex], Shoes[ShoeIndex - 1]);
ShoeIndex--;
}
}
else {
Answer += ShoeIndex;
while (ShoeIndex > 0) {
swap(Shoes[ShoeIndex], Shoes[ShoeIndex - 1]);
ShoeIndex--;
}
}
Shoes.erase(Shoes.begin());
Shoes.erase(Shoes.begin());
}
return Answer;
}
