# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
216177 | MODDI | 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.
void exploreCave(int n){
int arr[n], door[n];
memset(arr, 0, sizeof(arr));
memset(door,0,sizeof(door));
while(true){
int pos = tryCombination(arr);
if(pos == -1){
break;
}
arr[pos] = 1 - arr[pos];
}
for(int i = 0; i < n; i++){
arr[i] = 1 - arr[i];
int pos = tryCombination(arr);
//for(int j = 0; j < n;j++)
// cout<<arr[j]<<" ";
//cout<<pos<<endl;
door[i] = pos;
arr[i] = 1 - arr[i];
}
answer(arr, door);
}