제출 #949424

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
949424		steveonalex	Unscrambling a Messy Bug (IOI16_messy)	C++14	38 / 100	1 ms	436 KiB

messy

#include <bits/stdc++.h>
#include "messy.h"
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T& container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

const int INF = 2e9 + 69;

vector<int> restore_permutation(int n, int w, int r) {
    vector<int> perm(n);
    string cur = string(n, '0');
    for(int i = 0; i<n; ++i){
        cur[i] = '1';
        add_element(cur);
    }
    compile_set();

    cur = string(n, '0');
    for(int i= 0; i<n; ++i){
        for(int j = 0; j< n; ++j) if (cur[j] == '0'){
            cur[j] = '1';
            if (check_element(cur)){
                perm[j] = i;
                break;
            }
            cur[j] = '0';
        }
    }

    return perm;
}


// int main(void){
//     ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

//     return 0;
// }

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