# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
166692 | sams | Cave (IOI13_cave) | C++14 | 27 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"
void exploreCave(int N) {
int S[N+1];
int D[N+1];
for(int i = 0 ; i < N ; ++i) S[i] = D[i] = 0;
for(int i = 0 ; i < N ; ++i)
{
S[i] = 1;
int s = tryCombination(S);
//printf("%d\n", s);
D[i] = s;
S[i] = 0;
}
answer(S, D);
}
# | 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... |