Submission #146406

#	Time	Username	Problem	Language	Result	Execution time	Memory
146406		mperos	Unscrambling a Messy Bug (IOI16_messy)	C++14	100 / 100	4 ms	632 KiB

messy

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

using namespace std;

void generate_strings(int n, int l, int r) {
    if(l == r) return;

    string s;
    for(int i = 0; i < n; i++)
        s += "0";
    for(int i = l; i <= r; i++)
        s[i] = '1';
    int mid = (l + r) / 2;
    for(int i = l; i <= mid; i++) {
        s[i] = '0';
        add_element(s);
        s[i] = '1';
    }

    generate_strings(n, l, mid);
    generate_strings(n, mid + 1, r);
}



void query(int n, int l, int r, vector<int> v, vector <int>& p) {
    if(l == r){
        p[l] = v[0];
        return;
    }

    vector <int> left;
    vector <int> right;

    string s;
    for(int i = 0; i < n; i++)
        s += "0";
    for(int i : v)
        s[i] = '1';
    int mid = (l + r) / 2;
    for(int i : v) {
        s[i] = '0';
        bool val = check_element(s);
        if(val == true)
            left.push_back(i);
        else
            right.push_back(i);
        s[i] = '1';
    }

    query(n, l, mid, left, p);
    query(n, mid + 1, r, right, p);
}

vector<int> restore_permutation(int n, int w, int r) {
    vector <int> v;
    vector <int> p(n);
    vector <int> pos(n);
    generate_strings(n, 0, n - 1);
    compile_set();
    for(int i = 0; i < n; i++)
        v.push_back(i);
    query(n, 0, n - 1, v, p);
    for(int i = 0; i < n; i++)
        pos[p[i]] = i;

    return pos;
}

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