제출 #722864

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
722864		GrandTiger1729	Arranging Shoes (IOI19_shoes)	C++17	30 / 100	1096 ms	4676 KiB

shoes

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

long long count_swaps(vector<int> s){
	auto a = s;
    int N = a.size(), n = N / 2;
    vector<int> b;
    for (int i = 0; i < N; i++)
        if (a[i] < 0)
            b.push_back(a[i]);
    sort(b.begin(), b.end());
    long long ans = 1ll * N * N;
    do {
        long long cnt = 0;
        vector<int> c(N);
        for (int i = 0; i < n; i++)
            c[2 * i] = b[i], c[2 * i + 1] = -b[i];
        vector<int> aa = a;
        for (int i = 0; i < N; i++){
            int j = i;
            while (j < N && aa[j] != c[i]) j++;
            while (j > i){
                swap(aa[j], aa[j - 1]);
                j--;
                cnt++;
            }
        }
        ans = min(ans, cnt);
    }while (next_permutation(b.begin(), b.end()));
    return ans;
}

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