Submission #1292561

#	Time	Username	Problem	Language	Result	Execution time	Memory
1292561		lukaye_19	Arranging Shoes (IOI19_shoes)	C++20	0 / 100	1 ms	336 KiB

shoes

#include <bits/stdc++.h>
using namespace std;

long long count_swaps(vector<int> Shoes) {
    long long Answer = 0;

    while (Shoes.size() != 0) 
    {
        int FirstShoe = Shoes[0];
        int FirstShoeSize = abs(FirstShoe);

        int ShoeIndex = -1;

        for (int i = 1; i < Shoes.size(); i++) 
        {
            if (abs(Shoes[i]) == FirstShoeSize && 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;
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 15
• Subtask 5: 0 / 20
• Subtask 6: 0 / 15