제출 #753701

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
753701		Stickfish	Cheerleaders (info1cup20_cheerleaders)	C++17	13 / 100	2059 ms	2852 KiB

cheerleaders

#include <iostream>
#include <vector>
#include <cassert>
using ll = long long;
using namespace std;

ll get_inversion(vector<int>& p) {
    int n = p.size();
    ll ans = 0;
    for (int i = 0; i < n; ++i) for (int j = i + 1; j < n; ++j) {
        ans += p[i] > p[j];
    }
    return ans;
}

vector<int> combine_permutations(vector<int> a, vector<int> b) {
    int n = a.size();
    vector<int> ans(n);
    for (int i = 0; i < n; ++i) {
        ans[i] = b[a[i]];
    }
    return ans;
}

vector<int> reverse_permutation(vector<int> a) {
    int n = a.size();
    vector<int> ans(n);
    for (int i = 0; i < n; ++i)
        ans[a[i]] = i;
    return ans;
}

pair<ll, string> get_ans(vector<int> p) {
    int n = p.size();
    vector<int> aaa = p;
    ll ans = get_inversion(aaa);
    int ansx = 0;
    //for (int bt = n / 2; bt > 0; bt /= 2) {
        //int nx = ansx + bt;
    for (int nx = 0; nx < n; ++nx) {
        vector<int> op(n);
        for (int i = 0; i < n; ++i)
            op[i] = i ^ nx;
        vector<int> np = combine_permutations(op, p);
        ll nans = get_inversion(np);
        if (nans < ans) {
            ans = nans;
            ansx = nx;
        }
    }
    string ansa = "";
    for (int bt = n / 2; bt > 0; bt /= 2) {
        if (ansx & bt)
            ansa.push_back('1');
        ansa.push_back('2');
    }
    //cout << ans << ' ' << ansx << endl;
    return {ans, ansa};
}

signed main() {
    int N;
    cin >> N;
    int m = (1 << N);
    vector<int> p(m);
    for (int i = 0; i < m; ++i)
        cin >> p[i];
    if (N == 0) {
        cout << "0\n";
        cout << "1\n";
        return 0;
    }
    vector<int> op1(m);
    vector<int> op2(m);
    for (int i = 0; i < m; ++i) {
        op1[i] = i ^ (m / 2);
        op2[i] = (i >> 1) + ((i & 1) << (N - 1));
    }
    ll ans = 1ll * m * m;;
    string ansa;
    string curst = "";
    for (int t = 0; t < N; ++t) {
        auto [nans, nansa] = get_ans(p);
        if (nans < ans) {
            ans = nans;
            ansa = curst + nansa;
        }
        p = combine_permutations(op2, p);
        curst.push_back('2');
    }
    cout << ans << '\n';
    cout << ansa << '\n';
    //for (int i = 0; i < m; ++i)
        //cout << p[i] << ' ';
    //cout << endl;
    for (auto x : ansa) {
        if (x == '1')
            p = combine_permutations(op1, p);
        else
            p = combine_permutations(op2, p);
    }
    //for (int i = 0; i < m; ++i)
        //cout << p[i] << ' ';
    //cout << endl;
    //cout << get_inversion(p) << endl;
    assert(get_inversion(p) == ans);
}

• Subtask 1: 8 / 16
• Subtask 2: 5 / 10
• Subtask 3: 0 / 25
• Subtask 4: 0 / 21
• Subtask 5: 0 / 28