제출 #1077484

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

shoes

// Ignut

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

const int INF = 1e9 + 123;

ll count_swaps(vector<int> S) {
    ll res = INF;
    int n = S.size();
    vector<int> vec = S;
    sort(vec.begin(), vec.end());
    for (int i = 1; i <= n / 2; i ++) vec.pop_back();
    do {
        vector<int> s = S;
        vector<int> t;
        for (int val : vec) {
            t.push_back(val);
            t.push_back(-val);
        }
        int ans = 0;
        for (int i = 0; i < n; i ++) {
            int j;
            for (j = i; j < n; j ++)
                if (s[j] == t[i])
                    break;
            while (j > i) {
                swap(s[j - 1], s[j]);
                j --;
                ans ++;
            }
        }
        // for (int val : t) cout << val << ' ';
        // cout << " : " << ans << '\n';
        res = min(res, 1ll * ans);
    } while (next_permutation(vec.begin(), vec.end()));
    return res;
}

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