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>
#define try tryCombination
using namespace std;
const int MAXN = 5e3+5;
int S[MAXN];
int D[MAXN];
int st[MAXN];
int N;
bool check(int t,bool open, int i){
for(int j=0;j<=t&&j<N;j++)st[j]=open;
for(int j=t+1;j<N;j++)st[j]=!open;
for(int j=0;j<i;j++)st[D[j]]=S[D[j]];
int h=try(st);
return h==i;
}
void exploreCave(int N){
::N=N;
for(int i=0;i<N;i++){
int t=try(S);
bool open=false;
if(t==i)open=true;
int x=-1;
for(int b=N;b>=1;b/=2)
while(check(x+b,open,i))x+=b;
D[i]=x+1;
S[D[i]]=open;
}
answer(S,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... |