제출 #1215758

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1215758		Szil	Arranging Shoes (IOI19_shoes)	C++20	30 / 100	1097 ms	4400 KiB

shoes

#include "shoes.h"
#include <bits/stdc++.h>

using namespace std;

long long count_swaps(std::vector<int> s) {
	int n = s.size()/2;
    vector<int> v = s;
    for (int &i : v) cin >> i;
    
    vector<int> val;
    for (int i : v) {
        if (i > 0) val.emplace_back(i);
    }
    sort(val.begin(), val.end());
    int ans = 1e9;
    do {
        vector<int> goal;
        for (int i : val) {
            goal.emplace_back(-i);
            goal.emplace_back(i);
        }
        vector<bool> done(2*n);
        vector<int> arr;
        for (int i = 0; i < 2*n; i++) {
            int j = 0;
            for (; j < 2*n; j++) {
                if (!done[j] && goal[j] == v[i]) {
                    break;
                }
            }
            done[j] = 1;
            arr.emplace_back(j);
        }
        int curr = 0;
        for (int i = 0; i < 2*n; i++) {
            for (int j = 0; j < i; j++) {
                if (arr[j] > arr[i]) curr++;
            }
        }
        ans = min(ans, curr);
    } while (next_permutation(val.begin(), val.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