Submission #301132

#	Time	Username	Problem	Language	Result	Execution time	Memory
301132		eagle30	Arranging Shoes (IOI19_shoes)	C++14	10 / 100	1093 ms	8952 KiB

shoes

#include "shoes.h"
#include<bits/stdc++.h>
using namespace std;
int mi(vector<int> vi, int d){
    int n=vi.size(), mini=2e9;
    bool is=true;
    for(int i=0; i<n; i+=2){
        if(vi[i]>0 || vi[i+1]<0 || -vi[i]!=vi[i+1])
            is=false;
    }
    if(is)
        return d;
    if(d==8)
        return 2000000000;
    for(int i=0; i<n-1; i++){
        swap(vi[i], vi[i+1]);
        mini=min(mini, mi(vi, d+1));
        swap(vi[i], vi[i+1]);
    }
    return mini;
}
long long count_swaps(vector<int> s) {
    int hi=mi(s, 0);
    if(hi!=2000000000)
        return mi(s, 0);
    else
        return 8;
}

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