# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
432097 | MilosMilutinovic | Cave (IOI13_cave) | C++14 | 2 ms | 716 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 tryCombination(int S[]);
void answer(int S[], int D[]);
void exploreCave(int N) {
int combination[N];
vector<bool> locked(N, false);
for (int i = 0; i < N; i++) {
vector<int> positions;
for (int j = 0; j < N; j++)
if (!locked[j])
positions.push_back(j);
int current = tryCombination(combination);
bool need_diff = (current == -1 || current > i);
int bot = 0, top = (int) positions.size() - 1, pos = -1;
while (bot <= top) {
int mid = bot + top >> 1;
for (int j = 0; j < mid; j++)
combination[j] ^= 1;
if (need_diff)
combination[mid] ^= 1;
if (tryCombination(combination) == i)
pos = mid, bot = mid + 1;
else
top = mid - 1;
for (int j = 0; j < mid; j++)
combination[j] ^= 1;
if (need_diff)
combination[mid] ^= 1;
}
assert(pos != -1);
locked[pos] = true;
combination[pos] ^= 1;
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |