| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1083084 | erdemfurkan | Cave (IOI13_cave) | C++14 | 9 ms | 600 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 <algorithm>
void exploreCave(int N) {
int combination[N];
for(int i = 0; i < N; i++) {
combination[i] = 0;
}
// Hepsi açık
int S[N];
int D[N];
for(int i = 0; i < N; i++) {
S[i] = 0;
}
for(int i = 0; i < N; i++) {
combination[i] = 1;
int x = tryCombination(combination);
D[i] = x;
combination[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... | ||||
