| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 107079 | stefdasca | Cave (IOI13_cave) | C++14 | 0 ms | 0 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+2], D[N+2];
memset(S, 0, sizeof(S));
memset(D, 0, sizeof(D));
int P[N+2], pus[N+2];
memset(P, 0, sizeof(P));
memset(pus, 0, sizeof(pus));
for(int i = 0; i < n; ++i)
{
int st = 0;
int dr = n-1;
for(int j = 0; j < n; ++j)
if(pus[j])
P[j] = S[j];
else
P[j] = 1;
int ans = tryCombination(P);
bool ce = 0;
if(ans > i)
ce = 1;
while(st < dr)
{
int mid = (st + dr) / 2;
for(int j = 0; j < n; ++j)
{
if(pus[j])
P[j] = S[j];
else
if(st <= j && j <= mid)
P[j] = ce;
else
P[j] = ce ^ 1;
}
ans = tryCombination(P);
if(ans > i)
dr = mid;
else
st = mid + 1;
}
pus[st] = 1;
S[st] = i;
D[st] = ce;
}
answer(S, D);
}