Submission #1089596

#	Time	Username	Problem	Language	Result	Execution time	Memory
1089596		Tymond	Unscrambling a Messy Bug (IOI16_messy)	C++17	38 / 100	1 ms	600 KiB

messy

#include <bits/stdc++.h>
#include "messy.h"
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define vi vector<int>
#define vll vector<long long>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng64(chrono::steady_clock::now().time_since_epoch().count());
inline int rand(int l,int r){return uniform_int_distribution<int>(l, r)(rng);}
inline ll rand(ll l,ll r){return uniform_int_distribution<ll>(l, r)(rng64);}
#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif
 
struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        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);
    }
};
 
vi restore_permutation(int n, int w, int r) {
    vi p(n, 0);
    string s = "";
    for(int i = 0; i < n; i++){
        s += "0";
    }
    string t = s;
    vi vec;
    for(int i = 0; i < n; i++){
        vec.pb(i);
    }
    shuffle(all(vec), rng);
 
    for(int i = 0; i < n; i++){
        s[vec[i]] = '1';
        add_element(s);
    }
    compile_set();
    vi used(n, 0);
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            if(!used[j]){
                t[j] = '1';
                if(check_element(t)){
                    used[j] = 1;
                    p[j] = vec[i];
                    break;
                }else{
                    t[j] = '0';
                }
            }
        }
    }
 
    return p;
}

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