# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
869094 | AtabayRajabli | Cave (IOI13_cave) | C++17 | 2 ms | 348 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 q = 0;
int a[n], ans[n], d[n];
for(int i = 0; i<n; i++)
{
a[i] = 0;
}
for(int i = 0; i<n; i++)
{
int q = tryCombination(a);
if(q == -1)q = n;
for(int j = 0; j<n; j++)
{
a[j] ^= 1;
int k = tryCombination(a);
if(k == -1)k = n;
if(k < q)d[j] = k;
else if(k == q+1) d[j] = k-1;
else a[j] ^= 1;
}
}
answer(a, d);
}
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... |