# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
226515 | MBmasher | 동굴 (IOI13_cave) | C++14 | 33 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 combination[N] = {0};
int curHighest = -1;
int switches[N] = {};
curHighest = tryCombination(combination);
if (curHighest == -1) {
for (int i=0;i<N;i++) {
int combination[N] = {0};
combination[i] = 1;
switches[i] = tryCombination(combination);
}
int combination[N] = {0};
} else {
while (true) {
curHighest = tryCombination(combination);
if (curHighest == -1) {
break;
} else {
combination[curHighest] = 1;
}
}
for (int i=0;i<N;i++) {
switches[i] = i;
}
}
answer(combination, switches);
}
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... |