# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
16185 | ggoh | Cave (IOI13_cave) | C++98 | 555 ms | 640 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<cstdio>
#include "cave.h"
void exploreCave(int N)
{
int D[5555]={},S[5555]={},s[5555]={};
bool C[5555]={};
int i,p,q,h,ch,ima;
for(i=0;i<N;i++)
{
p=0;q=N;ch=0;
for(int j=0;j<N;j++)
{
if(C[j])s[j]=S[j];
else s[j]=0;
}
ima=tryCombination(s);
if(ima!=i)
{
for(int j=0;j<N;j++)
{
if(C[j])s[j]=S[j];
else s[j]=1;
}
ch=1;
}
while(p!=q-1)
{
h=(p+q)/2;
# | 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... |