# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
632539 | Stavab | Cave (IOI13_cave) | C++14 | 23 ms | 340 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 S[n], D[n];
for(int i = 0; i < n; i++)
{
S[i] = 0;
D[i] = -1;
}
int cur, prev;
for(int i = 0; i < n; i++)
{
cur = tryCombination(S);
if(cur > i || cur == -1)
prev = 1;
else
prev = 0;
int low = 0;
int high = n - 1;
while(high - low > 1)
{
int middle = (low + high) / 2;
for(int j = low; j <= middle; j++)
{
if(D[j] == -1)
# | 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... |