| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 429466 | dariasc | Cave (IOI13_cave) | C++14 | 12 ms | 464 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 ans[N];
memset(ans, 0, sizeof ans);
for (int i = 0; i < N; i++) {
ans[i] = 1;
if (i == tryCombination(ans)) {
ans[i] = 0;
} else {
ans[i] = 1;
}
}
int conn[N];
for (int i = 0; i < N; i++) {
conn[i] = i;
}
answer(ans, conn);
}
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
