# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
145070 | youssefbou62 | 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 <bits/stdc++.h>
#include <cave.h>
using namespace std;
int n , door[5005] , Comb[5005] ;
void Rev(int l , int r ){
for(;l<=r;l++)if(door[l]!=-1)Comb[l]=!Comb[l];
}
void findDoor(){
int l =0 , r = n-1 ;
int start = tryCombination(Comb);
while (l<r && start != -1 ){
int mid = (l+r)/2 ;
Rev(l,mid);
int rep = tryCombination(Comb);
Rev(l,mid);
if( rep == start )l=mid+1;
else r = mid ;
}
assert(l==r||start==-1);
door[l]=start;
}
void exploreCave(int N){
memset(door,-1,sizeof door);
for(int i = 0 ; i < N ; i++ ){
findDoor();
}
for(int i = 0 ; i< N ; i++ ){
if( door[i]==-1){
rev(i,i);
door[i]=tryCombination(Comb);
rev(i,i);
}
}
answer(Comb,door);
}