제출 #796984

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
796984		That_Salamander	Unscrambling a Messy Bug (IOI16_messy)	C++17	0 / 100	1 ms	468 KiB

messy

#include <bits/stdc++.h>

using namespace std;

void add_element(string x);
bool check_element(string x);
void compile_set();

vector<int> restore_permutation(int n, int w, int r) {
    string s;
    s.resize(n, '0');

    for (int i = 0; i < n; i++) {
        s[i] = '1';
        add_element(s);
    }

    compile_set();
    
    vector<int> p(n);

    string curr;
    curr.resize(n, '0');

    vector<int> order;
    for (int i = 0; i < n; i++) order[i] = i;

    random_device rd;
    mt19937 rng(rd());

    for (int i = 0; i < n; i++) {
        shuffle(order.begin(), order.end(), rng);
        for (int j = 0; j < n; j++) {
            if (curr[order[j]] == '1') continue;

            curr[order[j]] = '1';
            if (check_element(curr)) {
                p[order[j]] = i;
                break;
            } else {
                curr[order[j]] = '0';
            }
        }
    }

    return p;
}

#ifdef BRUH
namespace helper {

    set<string> set_;
    bool compiled = false;
    int n;
    vector<int> p;
    int w;
    int r;

    int read_int() {
        int x;
        cin >> x;
        return x;
    }

}

using namespace helper;


// A convenience function.
int get_p(int i) {
    int ret = p[i];
    return ret;
}

int main() {
    n = read_int();
    w = read_int();
    r = read_int();
    p = vector<int>(n);
    for (int i = 0; i < n; i++) {
        p[i] = i;
    }

    random_device rd;
    mt19937 g(rd());
    shuffle(p.begin(), p.end(), g);

    vector<int> answer = restore_permutation(n, w, r);
    
    if (answer.size() != n) {
        printf("WA\n");
        return 0;
    }


    printf("ANSWER:\n%d", answer[0]);

    for (int i = 1; i < n; i++) {
        printf(" %d", answer[i]);
    }
    printf("\n");

    printf("CORRECT:\n%d", p[0]);

    for (int i = 1; i < n; i++) {
        printf(" %d", p[i]);
    }
    printf("\n");
    return 0;
}

void wa() {
    printf("WA\n");
    exit(0);
}

bool check(const string& x) {
    if ((int)x.length() != n) {
        return false;
    }
    for (int i = 0; i < n; i++) {
        if (x[i] != '0' && x[i] != '1') {
            return false;
        }
    }
    return true;
}

void add_element(string x) {
    if (--w < 0 || compiled || !check(x)) {
        wa();
    }
    set_.insert(x);
}

bool check_element(string x) {
    if (--r < 0 || !compiled || !check(x)) {
        wa();
    }
    return set_.count(x);
}

void compile_set() {
    if (compiled) {
        wa();
    }
    compiled = true;
    set<string> compiledSet;
    string compiledElement = string(n, ' ');
    for (set<string>::iterator it = set_.begin(); it != set_.end(); it++) {
        string s = *it;
        for (int i = 0; i < n; i++) {
            compiledElement[i] = s[get_p(i)];
        }
        compiledSet.insert(compiledElement);
    }
    set_ = compiledSet;
}
#endif

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