# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
456215 | Khizri | 동굴 (IOI13_cave) | C++17 | 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"
int arr[5005],a[5005],b[5005];
void exploreCave(int N) {
//tryCombination(int S[])
for(int i=0;i<n;i++){
int q=tryCombination(arr);
if(q==i){
a[i]=1;
}
b[i]=i;
}
answer(a,b);
}