Submission #1196273

#	Time	Username	Problem	Language	Result	Execution time	Memory
1196273		countless	Unscrambling a Messy Bug (IOI16_messy)	C++20	38 / 100	1 ms	328 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);

vector<int> restore_permutation(int n, int w, int r) {
    string curr = string(n, '0');
    for (int i = 0; i < n; i++) {
        curr[i] = '1';
        add_element(curr);
    }

    compile_set();

    vector<int> avail(n);
    iota(all(avail), 0);
    vector<int> res(n);
    string base = string(n, '0'), check;

    auto cyc = [&](int shift) -> void {
        check = base;
        check[avail[shift]] = '1';
    };
    
    for (int i = 0; i < n; i++) {
        int shift = 0;
        bool found = false;
        while(shift < avail.size()) {
            cyc(shift);
            // cerr << base sp check << endl;
            if (check_element(check)) {
                res[i] = avail[shift];
                base[avail[shift]] = '1';
                avail.erase(avail.begin() + shift);
                found = true;
                break;
            }
            shift++;
        }
    }

    vector<int> ans(n);
    REP(i, 0, n) {
        ans[res[i]] = i;
    }

    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: 0 / 11
• Subtask 4: 0 / 21
• Subtask 5: 0 / 30