| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1080281 | Mihailo | 동굴 (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;
int tryCombination(int S[]);
void answer(int S[],int D[]);
int correct[10000], query[10000], rez[10000], cur;
vector<int> unknown;
int find_switch(int door, int l, int r) {
    if(l==r) {
        correct[unknown[l]]=cur;
        return l;
    }
    for(int i=0; i<unknown.size()-1; i++) query[unknown[i]]=1-cur;
    int m=(l+r)/2;
    for(int i=l; i<=m; i++) query[unknown[i]]=cur;
    if(tryCombination(query)==door) return find_switch(door, m+1, r);
    else return find_switch(door, l, m);
}
void exploreCave(int N) {
    for(int i=N-1; i>=0; i--) unknown.push_back(i);
    for(int i=0; i<N; i++) {
        for(int j=0; j<unknown.size(); j++) query[unknown[j]]=0;
        if(tryCombination(query)==i) cur=1;
        else cur=0;
        int x=find_switch(i, 0, unknown.size()-1)
        rez[i]=unknown[x];
        unknown.erase(unknown.begin()+x);
    }
    answer(correct, rez);
}
