Submission #1001261

#	Time	Username	Problem	Language	Result	Execution time	Memory
1001261		c2zi6	Unscrambling a Messy Bug (IOI16_messy)	C++14	20 / 100	1 ms	348 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"

VI restore_permutation(int n, int w, int r) {
    vector<string> vec;
    replr(i, 1, n-1) vec.pb(string(i, '1') + string(n-i, '0'));
    for (string s : vec) add_element(s);
    compile_set();
    VI ret;
    rep(i, n) ret.pb(i);
    for (int i = 0; i < n-1; i++) {
        string s = vec[i];
        if (!check_element(s)) {
            for (int j = 0; j < n; j++) {
                swap(s[i], s[j]);
                if (check_element(s)) {
                    swap(ret[i], ret[j]);
                    return ret;
                }
                swap(s[i], s[j]);
            }
        }
    }
    return ret;
}

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