| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 107359 | dolphingarlic | 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"
#pragma GCC optimize("O3")
#define FOR(i, x, y) for(int i = x; i < y; i++)
typedef long long ll;
using namespace std;
void exploreCave(int N) {
int unknown = N, known[5000], D[5000], S[5000], T[5000];
fill(known, known + N, -1);
FOR(i, 0, n) {
fill(S, S + n, 1);
FOR(j, 0, i) S[D[i]] = known[i];
// Find state of i-th gate
int res = tryCombination(S);
if (res < i) known[i] = 0;
else known[i] = 1;
// Binary search for D[i]
int l = 0, r = n - 1;
while (l != r) {
int mid = (l + r) / 2;
fill(T, T + n, 1 - known[i]);
fill(T + l, T + r + 1, known[i]);
FOR(j, 0, i) T[D[i]] = known[i];
int res = tryCombination(T);
if (res < i) l = mid + 1;
else r = mid;
}
D[i] = l;
}
answer(known, D);
}
