제출 #947215

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
947215		steveonalex	동굴 (IOI13_cave)	C++11	100 / 100	1293 ms	604 KiB

cave

#include "cave.h"
#include <bits/stdc++.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(ll mask){return __builtin_ctzll(mask);}
int logOf(ll 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());
    }

// int tryCombination(int S[]){
//     return 0;
// }
// void answer(int S[],int D[]){

// }
void exploreCave(int n) {
    int S[n], D[n];    
    vector<bool> used(n);
    for(int i= 0; i<n; ++i){
        int state[n];
        memset(state, 0, sizeof state);
        for(int j = 0; j < n; ++j) if (used[j]) state[j] = S[j];

        int v= tryCombination(state);
        bool correct_state = (v == i);
        int l = 0, r = n - 1;
        while(l < r){
            int mid = (l + r) >> 1;
            int state[n];
            memset(state, 0, sizeof state);
            for(int j = 0; j < n; ++j) if (used[j]) state[j] = S[j];
            for(int j = 0; j <= mid; ++j) if (!used[j]) state[j] = correct_state;
            for(int j = mid + 1; j < n; ++j) if (!used[j]) state[j] = !correct_state;

            if (tryCombination(state) == i) l = mid + 1;
            else r = mid;
        }
        int x = l;
        S[x] = correct_state;
        D[x] = i;
        used[x] = true;
    }
    answer(S, D);
}



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

• Subtask 1: 12 / 12
• Subtask 2: 13 / 13
• Subtask 3: 21 / 21
• Subtask 4: 30 / 30
• Subtask 5: 24 / 24