# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
65013 | theknife2001 | Cave (IOI13_cave) | C++17 | 893 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 "cave.h"
#include <bits/stdc++.h>
using namespace std;
const int NN=5e3+55;
int a[NN];
int p[NN];
int d[NN];
void exploreCave(int n)
{
memset(d,-1,sizeof d);
memset(p, 0,sizeof p);
for(int i=0;i<n;i++)
{
int x;
for(int j=0;j<n;j++)
a[j]=p[j];
int q=tryCombination(a);
if(q==-1)
q=n;
int l=0,r=n,mid;
// cout<<q<<endl;
while(l<r)
{
for(int j=0;j<n;j++)
a[j]=p[j];
mid=(l+r)/2;
for(int j=0;j<mid;j++)
# | 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... |