| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 280774 | jairRS | Cave (IOI13_cave) | C++17 | 32 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"
#include <vector>
using namespace std;
void exploreCave(int N)
{
int combination[5000];
int switches[5000];
int firstClosed = tryCombination(combination);
while (firstClosed != -1)
{
combination[firstClosed] = combination[firstClosed] * -1 + 1;
firstClosed = tryCombination(combination);
}
for (int i = 0; i < N; i++)
{
combination[i] = combination[i] * -1 + 1;
int firstClosed = tryCombination(combination);
switches[i] = firstClosed;
combination[i] = combination[i] * -1 + 1;
}
answer(combination, switches);
}| # | 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... | ||||
