제출 #761053

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
761053		GrindMachine	Unscrambling a Messy Bug (IOI16_messy)	C++17	0 / 100	1 ms	340 KiB

messy

// Om Namah Shivaya

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a, b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a, b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "messy.h"

std::vector<int> restore_permutation(int n, int w, int r) {
    string curr = string(n,'0');

    rev(i,n-1,1){
        curr[i] = '1';
        add_element(curr);
    }

    compile_set();

    vector<int> p(n);
    rep(i,n) p[i] = i;

    int mn_ones = inf1;
    pii px = {0,0};

    rep(i,1<<n){
        string s = "";
        rev(bit,n-1,0){
            if(i & (1 << bit)){
                s.pb('1');
            }
            else{
                s.pb('0');
            }
        }

        bool there = check_element(s);
        if(!there) conts;

        int ones = count(all(s),'1');
        int zeros = n - ones;

        if(ones > mn_ones) conts;

        mn_ones = ones;

        rep(i,n){
            if(i < zeros){
                if(s[i] == '1'){
                    px.ff = i;
                }
            }
            else{
                if(s[i] == '0'){
                    px.ss = i;
                }
            }
        }
    }

    swap(p[px.ff], p[px.ss]);

    return p;
}

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