# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
169292 | AlexLuchianov | Cave (IOI13_cave) | C++14 | 1171 ms | 564 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 <vector>
using namespace std;
void exploreCave(int N) {
int sol[N] = {0};
int door[N] = {0}, seen[N] = {0};
for(int i = 0; i < N; i++){
if(i != tryCombination(sol))
for(int j = 0; j < N; j++)
if(seen[j] == 0)
sol[j] ^= 1;
int from = 0, to = N - 1;
while(from < to){
int mid = (from + to) / 2;
for(int j = 0; j <= mid; j++)
if(seen[j] == 0)
sol[j] ^= 1;
int result = tryCombination(sol);
for(int j = 0; j <= mid; j++)
if(seen[j] == 0)
sol[j] ^= 1;
if(i == result)
from = mid + 1;
else
to = mid;
}
# | 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... |