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 N=5e3+55;
int a[N];
void exploreCave(int n)
{
int d[n];
int p[n];
memset(d,-1,sizeof d);
memset(p, 0,sizeof p);
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++)
a[i]=p[i];
int x;
int q=tryCombination(a);
x=tryCombination(a);
for(int j=0;j<n;j++)
{
if(d[j]!=-1)
continue ;
a[j]=1;
x=tryCombination(a);
if(q>i&&x==i)
{
d[i]=j;
p[i]=0;
break;
}
if(q==i&&x>i)
{
d[i]=j;
p[i]=1;
break;
}
}
}
answer(p,d);
}
# | 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... |