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"
int S[5005], D[5005];
void change(int s, int e){
for(int i=s; i<=e; i++){
S[i] ^= 1;
}
}
int find(int pos, int n){
int s = 0, e = n-1;
while (s != e) {
int m = (s+e)/2;
int t1 = tryCombination(S);
change(s,m);
int t2 = tryCombination(S);
change(s,m);
if(t1 != t2) e = m;
else s = m+1;
}
return s;
}
void exploreCave(int n){
for (int i=0; i<n; i++) {
D[i] = find(i,n);
if(tryCombination(S) == i) S[i] ^= 1;
}
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... |