# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
670625 | gustavo_d | Cave (IOI13_cave) | C++17 | 0 ms | 0 KiB |
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;
int exploreCave(int n) {
int confirmed[n];
int test[n];
int correspondence[n];
for (int i = 0; i < n; i++)
test[i] = 0;
ios_base::sync_with_stdio(false);
cin.tie(NULL);
for(int to_try = 0; to_try<n; to_try++) {
int l = 0; int r = n;
while (l != r) {
int mid = (l+r) / 2;
for (int i = l; i<r; i++) {
if (confirmed[i] != -1) test[i] = confirmed[i];
else {
if (i < mid) test[i] = 0;
else test[i] = 1;
}
}
int tried = tryCombination(test);
if (to_try != tried) {
r = mid;
} else {
l = mid + 1;
}
}
confirmed[i] = l;
correspondence[l] = i;
}
answer(confirmed, correspondence);
return 0;
}