# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
4479 | pichulia | Cave (IOI13_cave) | C++98 | 470 ms | 520 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"
#include<stdio.h>
static int sw[5005];
static int de[5005];
void exploreCave(int N) {
int i, j;
int l, r, m;
int s[5005];
for(i=0; i<N;i++)
{
sw[i] = -1;
s[i] = 1;
de[i] = -1;
}
int result1;
int result2;
for(i=0; i<N; i++)
{
l=0;r=N-1;
for(j=0;j<N;j++)
{
if(sw[j]==-1)
s[j]=1;
else
s[j]=sw[j];
}
result1 = tryCombination(s);
if(result1 == i)
{
# | 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... |