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