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;
void exploreCave(int n) {
int a[n],s[n];
vector<int>c;
for(int i=0;i<n;i++){
c.push_back(i);
a[i] = 0;
}
for(int i=0;i<n;i++){
int res = tryCombination(a);
int m = c.size();
if(res!= -1 && res < i){
int l = 0,r = m-1;
while(r>l){
int mid = (l+r)/2;
for(int j=0;j<=mid;j++)a[c[j]]^=1;
int cc = tryCombination(a);
if(cc==-1 || cc>=i)r = mid;
else l = mid+1;
for(int j=0;j<=mid;j++)a[c[j]]^=1;
}
s[i] = c[r];
a[c[r]]^=1;
c.erase(c.begin() + r);
}else{
int l = 0,r = m-1;
while(r>l){
int mid = (l+r)/2;
for(int j=0;j<=mid;j++)a[c[j]]^=1;
int cc = tryCombination(a);
if(cc!=-1 && cc<i)r = mid;
else l = mid+1;
for(int j=0;j<=mid;j++)a[c[j]]^=1;
}
s[i] = c[r];
c.erase(c.begin() + r);
}
}
answer(a,s);
}
# | 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... |