| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 783480 | mindiyak | Cave (IOI13_cave) | C++14 | 628 ms | 448 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>
#include <iostream>
using namespace std;
int createQuestion(int N,int connectedDoor[],int doorActive[],int left,int right,int active){
int question[N];
for(int i=0;i<N;i++){
if(connectedDoor[i] != -1){
question[i] = doorActive[i];
}else if(left <= i and i <= right){
question[i] = active;
}else{
question[i] = 1-active;
}
}
return tryCombination(question);
}
void exploreCave(int N) {
int doorActive[N],connectedDoor[N];
for(int i=0;i<N;i++){
doorActive[i]=0;
connectedDoor[i] = -1;
}
for(int i=0;i<N;i++){
int question[N];
int active = 0;
int val = createQuestion(N,connectedDoor,doorActive,0,N-1,1);
if(val == -1 or val > i){
active = 1;
}
int left=0,right=N-1;
while(right > left){
int mid = (left+right)>>1;
// cout << "search " << left << " " << mid << " " << right << endl;
int val = createQuestion(N,connectedDoor,doorActive,left,mid,active);
if(val == -1 or val > i){
right = mid;
}else{
left = mid+1;
}
}
// cout << "end " << i << " " << left << " " << right << endl << endl;
doorActive[left]=active;
connectedDoor[left] = i;
}
answer(doorActive,connectedDoor);
}
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... | ||||
