# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
97969 | AlexLuchianov | 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 "cave.h"
using namespace std;
/*
void answer(int S[], int D[]){
}
*/
/*
int tryCombination(int S[]){
}
*/
void voidexploreCave(int n) {
int door[n] = {0}, per[n] = {0}, seen[n] = {0};
for(int i = 0; i < n; i++){
int from = 0, to = n - 1;
if(i < tryCombination(door))
for(int j = 0; j < n; j++)
if(seen[j] == 0)
door[j] ^= 1;
while(from < to){
int mid = (from + to + 1) / 2;
for(int j = 0; j < mid; j++)
if(seen[j] == 0)
door[j] ^= 1;
if(i < tryCombination(door)){
to = mid - 1;
} else
from = mid;
for(int j = 0; j < mid; j++)
if(seen[j] == 0)
door[j] ^= 1;
}
per[from] = i;
seen[from] = 1;
}
answer(door, per);
}