Submission #1292578

#TimeUsernameProblemLanguageResultExecution timeMemory
1292578lukaye_19Arranging Shoes (IOI19_shoes)C++20
50 / 100
1097 ms2736 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; }
#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...