Submission #1001883

#	Time	Username	Problem	Language	Result	Execution time	Memory
1001883		c2zi6	Unscrambling a Messy Bug (IOI16_messy)	C++14	49 / 100	1 ms	600 KiB

messy

#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include "messy.h"

void xarnel(VI& a) {
    int n = a.size();
    rep(l, 3) rep(i, n) {
        int j = rand()%n;
        swap(a[i], a[j]);
    }
}

VI restore_permutation(int n, int w, int r) {
    srand(time(0));
    vector<int> idx;
    rep(i, n) idx.pb(i);
    xarnel(idx);
    vector<string> vec(n-1);
    replr(i, 0, n-2) {
        if (i) vec[i] = vec[i-1];
        else vec[i] = string(n, '0');
        vec[i][idx[i]] = '1';
    }
    for (string s : vec) add_element(s);
    compile_set();
    VI ret(n, idx.back());
    string s(n, '0');
    for (int i : idx) {
        rep(j, n) if (ret[j] == idx.back() && s[j] == '0') {
            s[j] = '1';
            if (check_element(s)) {
                ret[j] = i;
                break;
            }
            s[j] = '0';
        }
    }
    return ret;
}

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