| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 568572 | stevancv | Cave (IOI13_cave) | C++14 | 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>
#include "cave.h"
#define ll long long
#define ld long double
#define sp ' '
#define en '\n'
#define smin(a, b) a = min(a, b)
#define smax(a, b) a = max(a, b)
using namespace std;
const int N = 2e5 + 2;
const int M = 5e5 + 2;
int mod = 1000000007;
int tryCombination(vector<int> s);
void answer(vector<int> a, vector<int> b);
void exploreCave(int n) {
vector<int> ans(n, -1);
vector<int> sw(n, -1);
for (int i = 0; i < n; i++) {
vector<int> tmp(n);
for (int j = 0; j < n; j++) {
if (sw[j] == -1) tmp[j] = 0;
else tmp[j] = sw[j];
}
int x = (tryCombination(tmp) == i);
int l = 0, r = n - 1;
while (l < r) {
int mid = l + r >> 1;
for (int j = 0; j <= mid; j++) {
if (sw[j] == -1) tmp[j] = 1;
}
int y = (tryCombination(tmp) == i);
if (x == y) l = mid + 1;
else r = mid;
for (int j = 0; j <= mid; j++) {
if (sw[j] == -1) tmp[j] = 0;
}
}
sw[l] = x;
ans[l] = i;
}
answer(sw, ans);
}