# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
7003 | gs13068 | Cave (IOI13_cave) | C++98 | 1661 ms | 608 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"
int S[5000];
int D[5000];
int V[5000];
void exploreCave(int N)
{
int l,r,m;
int i,j,k;
for(i=0;i<N;i++)V[i]=0;
for(i=0;i<N;i++)
{
for(j=0;j<N;j++)if(!V[j])S[j]=0;
j=tryCombination(S);
if(j<0)j=N;
if(j>i)k=0;
else k=1;
l=0;r=N-1;
while(l<r)
{
m=(l+r)/2;
for(j=0;j<N;j++)if(!V[j])
{
if(j>=l&&j<=m)S[j]=k;
else S[j]=!k;
}
j=tryCombination(S);
if(j<0)j=N;
# | 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... |