제출 #1021980

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

messy

#include "messy.h"
#include <bits/stdc++.h>

using namespace std;

#define rall(s) s.rbegin(), s.rend()
#define all(s) s.begin(), s.end()
#define sz(s) (int)s.size()
#define s second 
#define f first   

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int N = 2e5 + 5;

mt19937_64 rng(1774123);

vector<int> restore_permutation(int n, int w, int r) {
    string h = "";
    for (int i = 0; i < n; i++) h += '0';
    for (int i = 0; i < n - 1; i++) {
        h[i] = '1';
        add_element(h);
    }
    compile_set();
    for (int i = 0; i < n; i++) h[i] = '0';
    vector<int> p(n), s;
    for (int i = 0; i < n; i++) s.push_back(i);
    shuffle(all(s), rng);
    for (int i = 0; i < n; i++) {
        for (int j: s) {
            if (h[j] == '1') continue;
            h[j] = '1';
            if (i == n - 1 || check_element(h)) {
                p[j] = i;
                break;
            }
            h[j] = '0';
        }
    }
    return p;
}

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