# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
870053 | AtabayRajabli | Cave (IOI13_cave) | C++17 | 28 ms | 500 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;
}
int l, r, mid;
for(int i = 0; i<n; i++)
{
l = 0, r = n-1;
while(l <= r)
{
mid = (l + r) / 2;
for(int i = mid; i<=r; i++)a[i] ^= 1;
int q = tryCombination(a);
if(q == i)l = mid + 1;
else r = mid - 1;
}
d[mid] = i;
ans[i] = a[mid];
}
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... |