제출 #992515

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
992515		MuntherCarrot	Arranging Shoes (IOI19_shoes)	C++14	10 / 100	1098 ms	2760 KiB

shoes

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define all(x) x.begin(), x.end()

ll count_swaps(vector<int> vec){
    auto prm = vec;
    int n = vec.size();
    sort(all(prm));
    ll ans = LLONG_MAX;
    do{
        bool good = 1;
        for(int i = 0; i < n; i += 2){
            if(prm[i] > 0 || -prm[i] != prm[i + 1]){
                good = 0;
            }
        }
        if(good == 0) continue;
        ll cnt = 0;
        auto f = vec;
        for(int i = 0; i < n; i++){
            int j = i;
            while(f[j] != prm[i]) j++;
            while(j > i){
                cnt++;
                swap(f[j], f[j - 1]);
                j--;
            }
        }
        ans = min(ans, cnt);
    }while(next_permutation(all(prm)));
    return ans;
}

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