제출 #797012

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

messy

#include <bits/stdc++.h>
#include "messy.h"
using namespace std;

#define FOR(i, n) for (int i = 0; i < n; i++)
#define PB push_back
#define ALL(x) x.begin(), x.end()

int n;
vector<int> p;

void write(int l, int r){
    if (l == r) return;
    string s;
    FOR(i, n) s += '1';
    for (int i = l; i <= r; i++) s[i] = '0';
    int mid = (l + r) / 2;
    for (int i = l; i <= mid; i++){
        s[i] = '1';
        add_element(s);
        s[i] = '0';
    }
    write(l, mid); write(mid + 1, r);
}

void solve(int l, int r, vector<int> idx){
    if (l == r){
        p[idx[0]] = l; return;
    }
    string s;
    FOR(i, n) s += '1';
    for (auto x : idx) s[x] = '0';
    set<int> in_left;
    vector<int> idx_left, idx_right;
    for (auto x : idx){
        s[x] = '1';
        if (check_element(s)) in_left.insert(x);
        s[x] = '0';
    }
    for (auto x : idx){
        if (in_left.count(x)) idx_left.PB(x); 
        else idx_right.PB(x);
    }
    int mid = (l + r) / 2;
    solve(l, mid, idx_left); solve(mid + 1, r, idx_right);
}

vector<int> restore_permutation(int N, int W, int R){
    n = N; p.resize(n, 0);
    write(0, n - 1);
    compile_set();
    vector<int> idx(n); iota(ALL(idx), 0);
    solve(0, n - 1, idx);
    return p;
}

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