| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 896690 | aqxa | 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 <bits/stdc++.h>
using namespace std;
// #include "cave.h"
const int mxn = 5001;
using ll = long long;
void exploreCave(int n) {
int ans[n], need[n];
for (int i = 0; i < n; ++i) {
need[i] = -1;
}
int t[n];
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
t[j] = (need[j] == -1 ? 0 : need[j]);
}
int can = tryCombination(t);
if (can == -1) can = n;
can = (can > i);
int lo = 0, hi = n - 1;
while (lo < hi) {
int mid = (lo + hi) / 2;
for (int j = lo; j <= mid; ++j) {
t[j] = (need[j] == -1 ? t[j] ^ 1 : need[j]);
}
int can2 = tryCombination(t);
if (can2 == -1) can2 = n;
can2 = (can > i);
if (can == can2) {
lo = mid + 1;
} else {
hi = mid;
can = can2;
}
}
assert(need[lo] == -1);
need[lo] = can ^ t[lo] ^ 1;
ans[lo] = i;
}
answer(need, ans);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
return 0;
}