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;
void exploreCave(int n) {
int d[n];
int s[n];
int cur[n];
for(int i=0;i<n;i++){
cur[i]=0;
d[i]=s[i]=-1;
}
for(int i=0;i<n;i++){
int xx=tryCombination(cur);
if(xx==-1)xx=1e9;
int ind=0;
if(xx==i)ind=1;
int l=-1,r=n-1;
int a[n];
while(l+1<r){
int mid=(l+r)/2;
for(int j=0;j<n;j++)a[j]=cur[j];
for(int j=0;j<=mid;j++){
if(s[j]==-1)a[j]=ind;
}
for(int j=mid+1;j<n;j++){
if(s[j]==-1)a[j]=1-ind;
}
xx=tryCombination(a);
if(xx==-1)xx=1e9;
if(xx>i)r=mid;
else l=mid;
}
s[r]=ind;
cur[r]=ind;
d[r]=i;
}
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... |