Submission #1187082

#	Time	Username	Problem	Language	Result	Execution time	Memory
1187082		eri16	Arranging Shoes (IOI19_shoes)	C++20	0 / 100	1095 ms	1956 KiB

shoes

#include "shoes.h"
#include <vector>
#include <cmath>

long long count_swaps(std::vector<int> s) {
    long long swaps = 0;
    int n = s.size();
    for (int i = 0; i < n; i += 2) {
        // s[i] must be a left shoe
        if (s[i] < 0) {
            // this should never happen if the input is guaranteed to be solvable
            continue;
        }
        int left_size = s[i];
        
        // Find the closest matching right shoe
        int j = i + 1;
        while (j < n && s[j] != -left_size) {
            ++j;
        }
        
        // Bring the right shoe to position i + 1 by adjacent swaps
        while (j > i + 1) {
            std::swap(s[j], s[j - 1]);
            --j;
            ++swaps;
        }
    }
    return swaps;
}

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