Submission #1292569

#TimeUsernameProblemLanguageResultExecution timeMemory
1292569lukaye_19Arranging Shoes (IOI19_shoes)C++20
0 / 100
1 ms336 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 = Shoes[0];
        int Matching = -FirstShoe;

        int Dist = 0;
        
        auto it = Shoes.begin() + 1;

        while (*it != Matching) 
        {
            ++it;
            
            Dist++;
        }

        Shoes.erase(it);
        Shoes.erase(Shoes.begin());

        Answer += Dist;

        if (FirstShoe < 0) 
        {
            Answer++;
        }
    }

    return Answer;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...