# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1216756 | nataliaa | Cave (IOI13_cave) | C++20 | 0 ms | 0 KiB |
#include "cave.h"
#include<bits/stdc++.h>
using namespace std;
void exploreCave(int N) {
int v[N];
int a[N] ={};
for(int i = 0; i < N; i++) v[i]= i;
for(int i = 0; i < N; i++) {
int l = 0, r= N-1;
while(l<=r) {
int m = (l+r)/2;
for(int j = 0; j <= m; j++) {
if(a[i]) a[i]=0;
else a[i]=1;
}
int k = tryCombination(a);
if(a<k) r = m-1;
else l=m+1;
}
a[r] =l;
}
answer( a,v);
}