Submission #1187080

#	Time	Username	Problem	Language	Result	Execution time	Memory
1187080		eri16	Arranging Shoes (IOI19_shoes)	C++20	0 / 100	1096 ms	1860 KiB

shoes

#include "shoes.h"

#include <iostream>
#include <vector>
#include <cmath>
using namespace std;

long long count_swaps(vector<int> S) {
    long long swaps = 0;
    int n = S.size();

    for (int i = 0; i < n; ) {
        if (S[i] < 0) {
            // Skip right shoes — can't start a pair
            ++i;
            continue;
        }

        int size = S[i];
        // Find matching right shoe
        int j = i + 1;
        while (j < n && S[j] != -size) {
            ++j;
        }

        // Move the right shoe leftward to i + 1
        while (j > i + 1) {
            swap(S[j], S[j - 1]);
            --j;
            ++swaps;
        }

        // Now valid pair at i, i+1
        i += 2;
    }

    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