# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
668434 | allin27x | Cave (IOI13_cave) | C++14 | 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 <iostream>
#include <vector>
#include <unordered_set>
using namespace std;
int tryCombination(int S[]);
void answer(int S[], int D[]);
void exploreCave(int N){
int doors[N]={};
int perm[N] = {};
unordered_set<int> f;
int tr[N] = {};
for (int s=0; s<N; s++){
int a = 0, b = N-1;
int pos = 0;
for (int i=0; i<N; i++){
if (f.count(i)) tr[i] = perm[i]; else tr[i]=0;
}
int r = tryCombination(tr);
if (r==s) pos = 1;
while (a!=b){
int m = (a+b)/2;
for (int i=0; i<N; i++){
if (f.count(i)) tr[i] = perm[i]; else tr[i]=(i<=m)?pos:!pos;
}
r = tryCombination(tr);
if (r==s) a = m+1; else b =m;
}
doors[a] = s;
perm[a] = pos;
f.insert(a);
}
answer(perm, doors);
}