제출 #130377

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
130377		darkkcyan	Unscrambling a Messy Bug (IOI16_messy)	C++14	100 / 100	5 ms	632 KiB

messy

#include <bits/stdc++.h>

#include "messy.h"

using namespace std;
typedef bitset<128> BS;

string reverse_string(string s) {
    reverse(s.begin(), s.end());
    return s;
}

void add_element(BS const& bs, int n) {
    add_element(reverse_string(bs.to_string()).substr(0, n));
}

bool check_element(BS const& bs, int n) {
    return check_element(reverse_string(bs.to_string()).substr(0, n));
}

int log2(int n) {
    if (n == 1) return 0;
    return 1 + log2(n / 2);
}

const BS one = 1;
void add_elements(int n) {
    BS prev;
    int n_bit = log2(n);
    for (int i = 1; i < n; i += 2) {
        prev[i] = 1;
        add_element(one << i, n);
    }

    for (int cur_bit = 1; cur_bit < n_bit;++ cur_bit) {
        BS cur;
        for (int i = 0; i < n; ++i) {
            if ((~i >> cur_bit) & 1) continue;
            cur[i] = 1;
            add_element((prev[i] ? ~prev : prev) | (one << i), n);
        }
        prev = move(cur);
    }
}

vector<int> do_restore(int n) {
    vector<int> ans(n);

    BS prev;
    for (int i = 0; i < n; ++i) {
        if (!check_element(one << i, n)) continue;
        prev[i] = 1;
        ans[i] = 1;
    }

    int n_bit = log2(n);
    for (int cur_bit = 1; cur_bit < n_bit; ++cur_bit) {
        BS cur;
        for (int i = 0; i < n; ++i) {
            if (!check_element((prev[i] ? ~prev : prev) | (one << i), n)) continue;
            cur[i] = 1;
            ans[i] |= 1 << cur_bit;
        }
        prev = move(cur);
    }
    return ans;
}

std::vector<int> restore_permutation(int n, int w, int r) {
    add_elements(n);
    compile_set();
    return do_restore(n);
}

• Subtask 1: 20 / 20
• Subtask 2: 18 / 18
• Subtask 3: 11 / 11
• Subtask 4: 21 / 21
• Subtask 5: 30 / 30