Submission #427129

#	Time	Username	Problem	Language	Result	Execution time	Memory
427129		ivan24	Unscrambling a Messy Bug (IOI16_messy)	C++14	0 / 100	2 ms	332 KiB

messy

#include "messy.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef pair<ll,ll> ii;
typedef vector<ii> vii;
typedef vector<vii> vvii;

ll min(ll x, ll y){
    return ((x < y) ? x : y);
}

ll max(ll x, ll y){
    return ((x > y) ? x : y);
}

std::vector<int> restore_permutation(int n, int w, int r) {
    for (ll i = 1; n > i; i++){
        string s;
        s.assign(n,'0');
        for (ll j = 0; i > j; j++){
            s[j] = '1';
        }
        add_element(s);
    }
    compile_set();
    vector<int> p;
    p.assign(n,-1);
    vi checked;
    checked.assign(n,0);
    for (ll i = 0; n > i; i++){
        for (ll j = 0; n > j; j++){
            if (checked[j]) continue;
            string s; s.resize(n);
            for (ll k = 0; n > k; k++){
                if (checked[k] || k == j) s[k] = '1';
                else s[k] = '0';
            }
            bool res = check_element(s);
            if (res){
                p[j] = i;
                checked[j] = true;
            }
        }
    }
    for (ll i = 0; n > i; i++){
        if (!checked[i]) p[i] = n-1;
    }
    return p;
}

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