# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
410846 | DavidDamian | Cave (IOI13_cave) | C++11 | 395 ms | 508 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 <iostream>
#include "cave.h"
using namespace std;
int status[5005];
int door[5005];
int locked[5005];
///Binary Search
///Update ranges
///Greedy
void reset(int n, int L, int R, int correct) ///Set segment of array to correct
{
for (int i = L; i <= R; i++) {
if (locked[i]) continue;
status[i] = correct;
}
}
int binarySearch(int n, int i, int correct) ///Perform binary search on i-th door
{
int L = 0, R = n - 1;
while (L < R) {
int mid = (L + R) / 2;
reset(n, L, mid, correct);
reset(n, mid + 1, R, !correct);
if (tryCombination(status) != i)
R = mid;
else
L = mid + 1;
}
# | 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... |