제출 #293827

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
293827		Aldas25	Unscrambling a Messy Bug (IOI16_messy)	C++14	49 / 100	1 ms	384 KiB

messy

#include <vector>

#include <bits/stdc++.h>

#include "messy.h"

using namespace std;

#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define REP(n) FOR(O, 1, (n))
#define f first
#define s second
#define pb push_back
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef vector<pii> vii;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

std::vector<int> restore_permutation(int n, int w, int r) {

    vi shuf(n);
    FOR(x, 0, n-1) shuf[x] = x;
    shuffle(shuf.begin(), shuf.end(), rng);
    string s = "";
    REP(n) s += "0";
    FOR(x, 0, n-1) {
        int i = shuf[x];
        s[i] = '1';
        add_element(s);
    }

    compile_set();

    vi perm(n);

    string cur = "";
    REP(n) cur += "0";
    FOR(y, 0, n-1) {
        int i = shuf[y];
        //shuffle(shuf.begin(), shuf.end(), rng);
        FOR(x, 0, n-1) {
            int j = shuf[x];
            if (cur[j] == '1') continue;
            cur[j] = '1';
            bool ok = check_element(cur);
            if (ok) {
                perm[j] = i;
                break;
            }
            cur[j] = '0';
        }
    }

    return perm;
}

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