# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
105202 | ly20 | Cave (IOI13_cave) | C++14 | 506 ms | 512 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<bits/stdc++.h>
#include "cave.h"
void exploreCave(int n)
{
int est[n],ord[n],resp[n];
for(int i=0;i<n;i++)
{
est[i]=0;
ord[i]=-1;
resp[i]=0;
}
if(n==1)
{
int k=tryCombination(est);
if(k==0)est[0]=1;
ord[0]=0;
answer(est,ord);
}
for(int at=0;at<n;at++)
{
int ini=0,fim=n-1;
int k=tryCombination(est);
while(ini<fim)
{
if(k>at || k==-1)
{
for(int i=ini;i<=fim;i++)if(ord[i]==-1)est[i]=1-est[i];
}
int m=(ini+fim)/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... |