# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1085346 | mingga | 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;
#define ln "\n"
#define dbg(x) cout << #x << " = " << x << ln
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define inf 2e18
#define fast_cin() \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define out(file) freopen(file, "w", stdout)
#define in(file) freopen(file, "r", stdin)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define int long long
int MOD = 1e9 + 7;
void exploreCave(int n) {
int comb[n], ans1[n], ans2[n];
vector<int> vis(n, 0);
for(int i = 0; i < n; i++) {
comb[i] = 0;
}
for(int i = 0; i < n; i++) {
int s = tryCombination(comb);
int col = (s > i) ? 0 : 1;
int l = 0, r = n - 1, res;
while(l <= r) {
int m = (l + r) >> 1;
for(int i = l; i <= m; i++) {
if(vis[i]) continue;
comb[i] ^= 1;
}
int cur = tryCombination(comb);
for(int i = l; i <= m; i++) {
if(vis[i]) continue;
comb[i] ^= 1;
}
if(cur < i) {
l = m + 1;
} else {
res = m;
r = m - 1;
}
}
ans1[i] = col;
ans2[res] = i;
vis[res] = 1;
}
answer(ans1, ans2);
}