제출 #20602

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

messy

// name = messy_iz.cpp, type = cpp.g++11

#include "messy.h"


#include <vector>
#include <string>

//#include "messy.h"

using namespace std;

std::vector<int> restore_permutation(int n, int w, int r) {
    for (int len = n / 2; len >= 1; len >>= 1) {
        for (int s = 0; s < n; s += 2 * len) {
            string a = "";
            for (int i = 0; i < n; i++) a += '1';
            for (int i = 0; i < len * 2; i++) a[s + i] = '0';
            for (int i = 0; i < len; i++) {
                string ss = a;
                ss[s + i] = '1';
                add_element(ss);
            }
        }
    }
    compile_set();
    vector<vector<int> > can(n);
    for (int i = 0; i < n; i++) can[0].push_back(i);
    for (int len = n / 2; len >= 1; len >>= 1) {
        for (int s = 0; s < n; s += 2 * len) {
            string a = "";
            for (int i = 0; i < n; i++) a += '1';
            for (int i = 0; i < (int)can[s].size(); i++) a[can[s][i]] = '0';
            vector<int> c1, c2;
            for (int i = 0; i < (int)can[s].size(); i++) {
                string ss = a;
                ss[can[s][i]] = '1';
                if (check_element(ss)) {
                    c1.push_back(can[s][i]);
                } else {
                    c2.push_back(can[s][i]);
                }
            }
            can[s] = c1;
            can[s + len] = c2;
        }
    }
    vector<int> ans(n);
    for (int i = 0; i < n; i++) ans[can[i][0]] = i;
    return ans;
}

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