Submission #1209181

#	Time	Username	Problem	Language	Result	Execution time	Memory
1209181		peej	Arranging Shoes (IOI19_shoes)	C++20	10 / 100	965 ms	1114112 KiB

shoes

#include "shoes.h"
#include <stdio.h>
#include <iostream>
#include <queue>
#include <math.h>

using namespace std;

bool is_valid(vector<int>& arr) {
    for (int i = 0; i < arr.size()/2; i++) {
        if (abs(arr[i*2]) != abs(arr[i*2+1])) return false;
        if (arr[i*2] > 0 || arr[i*2+1] < 0) return false;
    }
    return true;
}

long long count_swaps(std::vector<int> s) {
    // solve it meow
    queue<pair<int,vector<int>>> next;
    next.push(make_pair(0,s));

    while (!next.empty()) {
        // check if this array is valid
        if (is_valid(next.front().second)) return next.front().first;

        for (int i = 0; i < s.size()-1; i++) {
            vector<int> arr = next.front().second;
            swap(arr[i], arr[i+1]);

            next.push(make_pair(next.front().first+1, arr));
        }
        next.pop();
    }
    return 0;
}

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