# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
874329 | asli_bg | Cave (IOI13_cave) | C++11 | 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 "cave.h"
#include <bits/stdc++.h>
const int MAXN=5e3+3;
int S1[MAXN];
int S2[MAXN];
int D[MAXN];
void exploreCave(int N) {
/* ... */
int bas=0;
for(int i=0;i<N;i++){
D[i]=i;
}
////////////////////////////////
while(bas<N){
for(int i=bas;i<N;i++){
S1[i]=0;
}
int z=tryCombination(S1);
for(int i=bas;i<N;i++){
S2[i]=1;
}
int o=tryCombination(S2);
if(z==-1){
answer(S1,D);
}
else if(o==-1){
answer(S2,D);
}
else{
bas=max(o,z);
}
}
}