제출 #811949

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

messy

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,popcnt,sse4,abm")
#include <bits/stdc++.h>
using namespace std;

#ifndef WAIMAI
#include "messy.h"
#endif

#define ll long long
#define Waimai ios::sync_with_stdio(false), cin.tie(0)
#define FOR(x,a,b) for (int x = a, I = b; x <= I; x++)
#define pb emplace_back
#define F first
#define S second

#ifdef WAIMAI
void add_element(string x);
bool check_element(string x);
void compile_set();
#endif

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int rnd(int l, int r) {
    return uniform_int_distribution<int>(l, r)(rng);
}

vector<int> restore_permutation(int n, int w, int r) {
    string s(n, '0');
    FOR (i, 0, n - 2) {
        s[i] = '1';
        add_element(s);
    }
    compile_set();
    vector<int> p(n, -1), cand(n);
    iota(cand.begin(), cand.end(), 0);
    s = string(n, '0');
    FOR (i, 0, n - 1) {
        shuffle(cand.begin(), cand.end(), rng);
        FOR (j, 0, cand.size() - 2) {
            s[cand[j]] = '1';
            if (check_element(s)) {
                p[i] = cand[j];
                cand.erase(cand.begin() + j);
                break;
            }
            s[cand[j]] = '0';
        }
        if (p[i] == -1) {
            s[cand.back()] = '1';
            p[i] = cand.back();
            cand.pop_back();
        }
    }
    vector<int> tmp = p;
    FOR (i, 0, tmp.size() - 1) p[tmp[i]] = i;
    return p;
}

/*
in1
4 16 16
2 1 3 0
out1
2 1 3 0
*/

#ifdef WAIMAI
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] = read_int();
    }
    vector<int> answer = restore_permutation(n, w, r);

    if (answer.size() != n) {
        printf("WA\n");
        return 0;
    }


    printf("%d", answer[0]);

    for (int i = 1; i < n; i++) {
        printf(" %d", answer[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: 20 / 20
• Subtask 2: 18 / 18
• Subtask 3: 0 / 11
• Subtask 4: 0 / 21
• Subtask 5: 0 / 30