| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1113755 | vladilius | Cave (IOI13_cave) | C++17 | 0 ms | 0 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define pb push_back
#define ff first
#define ss second
void exploreCave(int n){
    vector<int> b(n), p(n), s(n), ch;
    for (int i = 0; i < n; i++) ch.pb(i);
    for (int i = 0; i < n; i++){
        fill(s.begin(), s.end(), 0);
        for (int j = 0; j < i; j++){
            s[p[j]] = b[j];
        }
        int f = tryCombination(s), d = (f == i);
        b[i] = d;
        int l = 0, r = (int) ch.size() - 1;
        
        auto check = [&](int m){
            for (int j = 0; j <= m; j++){
                s[ch[j]] = d;
            }
            for (int j = m + 1; j < ch.size(); j++){
                s[ch[j]] = !d;
            }
            int f = tryCombination(s);
            return (f != i);
        };
        
        while (l + 1 < r){
            int m = (l + r) / 2;
            if (check(m)){
                r = m;
            }
            else {
                l = m + 1;
            }
        }
        if (check(l)) r = l;
        p[i] = ch[r];
        ch.erase(ch.begin() + r);
    }
    vector<int> x(n), y(n);
    for (int i = 0; i < n; i++){
        x[p[i]] = i;
        y[p[i]] = b[i];
    }
    
    answer(y, x);
}
