| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1292577 | lukaye_19 | Arranging Shoes (IOI19_shoes) | C++20 | 0 ms | 0 KiB |
#include "bits/stdc++.h>"
using namespace std;
long long count_swaps(vector<int>Shoes) {
vector<int>ShoesQueue = Shoes;
int Answer = 0;
while (!ShoesQueue.empty()) {
int FirstShoe = -(*ShoesQueue.begin());
int DistanceToPair = 0;
auto it = ++ShoesQueue.begin();
while (*it != FirstShoe) {
++it;
DistanceToPair++;
}
ShoesQueue.erase(it);
ShoesQueue.erase(ShoesQueue.begin());
Answer += DistanceToPair;
if (FirstShoe < 0) {
Answer++;
}
}
return Answer;
}
