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 pos[n];
for(int i = 0;i<n;i++){
pos[i] = -1;
}
int switched[n];
vector<bool> vis(n,0);
for(int i = 0;i<n;i++){
for(int j = 0;j<n;j++){
if(!vis[j])
switched[j] = 0;
}
int l = 0;
int r = n-1;
int x = 0;
int mid = 0;
bool flag = 1;
if(x == i){
flag = 0;
}
while(l<r){
mid = (l+r) >> 1;
for(int h = l;h<=mid;h++){
if(!vis[h])
switched[h] = flag;
}
for(int h = 0;h<l;h++){
if(!vis[h])
switched[h] = !flag;
}
for(int h = mid+1;h<n;h++){
if(!vis[h])
switched[h] = !flag;
}
x = tryCombination(switched);
if(x == i)
l = mid;
else r = mid;
}
vis[r] = 1;
pos[r] = i;
switched[i] = flag;
}
answer(switched,pos);
}
# | 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... |