제출 #465371

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
465371		aris12345678	Arranging Shoes (IOI19_shoes)	C++14	0 / 100	0 ms	204 KiB

shoes

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

typedef long long ll;
typedef pair<int, int> pii;
#define X first
#define Y second

const int mxN = 100005;

bool check(vector<pii> s) {
    int n = int(s.size());
    for(int i = 1; i < n; i+=2) {
        if(s[i].X != -s[i-1].X)
            return false;
    }
    return true;
}

ll count_swaps(vector<int> s) {
    int n = int(s.size());
    if(n <= 16) {
        vector<pii> shoes;
        for(int i = 0; i < n; i++)
            shoes.push_back({s[i], i});
        sort(shoes.begin(), shoes.end());
        ll ans = LLONG_MAX;
        do {
            ll res = 0;
            if(!check(shoes)) continue;
            for(int i = 0; i < n; i++)
                res += abs(shoes[i].Y-i-1);
            ans = min(ans, res);
        } while(next_permutation(shoes.begin(), shoes.end()));
        return ans;
    } else {
        n /= 2;
        n--;
        return 1LL*n*(n+1)/2;
    }
    assert(true);
}

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