# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
290615 | Ruba_K | Cave (IOI13_cave) | C++14 | 73 ms | 512 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>
using namespace std ;
void exploreCave(int N) {
int arr[N] = {} , pos[N];
memset(arr , 0 , sizeof arr);
for(int i = 0 ; i < N ; i ++){
int ret = tryCombination(arr);
for(int j = i + 1 ; j < N ; j ++)arr[j] = 1 ;
int ret2 = tryCombination(arr);
if(ret == ret2)arr[i] = 1 , pos[i] = ret ;
else{
arr[i] = 1 ;
ret = tryCombination(arr);
pos[i] = ret ;
arr[i] = 0 ;
}
for(int j = i + 1 ; j < N ; j ++)
arr[j] = 0 ;
}
answer(arr , pos);
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |