# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
382322 | Andyvanh1 | Cave (IOI13_cave) | C++14 | 18 ms | 492 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 <iostream>
#include <vector>
#include "cave.h"
using namespace std;
void exploreCave(int n){
int S[n];
int D[n];
for(int i = 0; i < n; i++){
S[i] = 0;
D[i] = i;
}
int k = 0;
for(int i = 0; i < n; i++){
S[i] = 1;
D[i] = tryCombination(S);
S[i] = 0;
}
answer(S,D);
}
Compilation message (stderr)
# | 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... |