Submission #1196698

#	Time	Username	Problem	Language	Result	Execution time	Memory
1196698		countless	Unscrambling a Messy Bug (IOI16_messy)	C++20	100 / 100	2 ms	584 KiB

messy

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

typedef long long ll;
typedef long double ld;

const ll MOD = 998244353;
const ll INF = 1e18;
const ld EPS = 1e-12;

#define endl "\n"
#define sp <<" "<<
#define REP(i, a, b) for(ll i = a; i < b; i++)
#define dbg(x) cout << #x << " = " << x << endl
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define fast_io() ios_base::sync_with_stdio(false); cin.tie(NULL)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((ll)(x).size())

struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        // http://xorshift.di.unimi.it/splitmix64.c
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};

template <typename Key, typename Value>
using hash_map = unordered_map<Key, Value, custom_hash>;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// uniform_int_distribution<int>(a, b)(rng);
// shuffle(all(a), rng);

// step 1
// 1 0 0 0 0 0 0 0
// 0 1 0 0 0 0 0 0
// 0 0 1 0 0 0 0 0
// 0 0 0 1 0 0 0 0
// 1 1 1 1 1 0 0 0
// 1 1 1 1 0 1 0 0
// 1 1 1 1 0 0 1 0
// 1 1 1 1 0 0 0 1

int n;
vector<int> ans;

void decomp(int l, int r) {
    int size = r - l;
    int m = size / 2;
    if (size == 1) return;

    REP(i, l, l + m) {
        string query = string(n, '1');

        REP(j, l, r) {
            query[j] = '0';
        }

        query[i] = '1';
        
        add_element(query);
    }

    decomp(l, l + m);
    decomp(l + m, r);
}

void parse(int l, int r, set<int> &f) {
    int size = r - l;
    int m = size / 2;

    if (size == 1) {
        ans[*f.begin()] = l;
        return;
    }

    set<int> left, right;
    for (auto &i : f) {
        string query = string(n, '0');

        REP(j, 0, n) {
            if (i == j or f.count(j) == 0) {
                query[j] = '1';
            }
        }

        if (check_element(query)) {
            left.insert(i);
        } else {
            right.insert(i);
        }
    }

    parse(l, l + m, left);
    parse(l + m, r, right);
}

vector<int> restore_permutation(int _n, int w, int r) {
    n = _n;
    ans.resize(n);

    decomp(0, n);

    compile_set();

    set<int> inds;
    REP(i, 0, n) inds.insert(i);
    parse(0, n, inds);

    return ans;
}

Compilation message (stderr)

messy.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
messy_c.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~

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