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>
using namespace std;
int result[5000],match[5000],sent[5000];
bool iflastopen,fixed_[5000];
void change(int a, int b, int c){
for(int i=a;i<=b;i++){
if(!fixed_[i])
sent[i]= c;
}
}
void exploreCave(int n){
for(int j=0;j<n;j++){
change(0,n-1,1);
if(tryCombination(sent)>j)
iflastopen=1;
else
iflastopen=0;
int pocz=0;
int kon=n-1;
while(pocz!=kon){
int sr=(pocz+kon)/2;
change(pocz,sr,iflastopen);
int ak=tryCombination(sent);
if(ak > j)
{
kon=sr;
}
else{
pocz=sr+1;
}
}
sent[pocz] = iflastopen;
match[j]=pocz;
fixed_[pocz]=1;
}
answer(sent,match);
}
# | 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... |