# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1216655 | lizi14 | Cave (IOI13_cave) | C++20 | 0 ms | 0 KiB |
#include "cave.h"
using namespace std;
void exploreCave(int N) {
int x[N];
int s[N];
fill(s,s+N,0);
fill(x,x+N,0);
int an=0;
while(true){
int a=tryCombination(x[N]);
if(a==-1){
break;
}
if(a>an){
for(int i=0; i<an; i++){
if(s[i]!=x[i]){
s[i]=x[i];
}
}
a=an-1;
}
else x[a]=1-x[a];
}
return 0;
}