| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1292557 | 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) {
long long Answer = 0;
while (Shoes.size() != 0)
{
int FirstShoe = S[0];
int FirstShoeSize = abs(FirstShoe);
int ShoeIndex = -1;
for (int i = 1; i < Shoes.size(); i++)
{
if (abs(Shoes[i]) == FirstShoe)
{
Answer = 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;
}
