# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
231186 | AASG | Cave (IOI13_cave) | C++17 | 86 ms | 384 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;
void exploreCave(int N) {
int n=N;
int R[n];int P[n];
int aux2[n];
int x;
bool z;
for(int i=0;i<n;i++){
R[i]=1;
P[i]=0;
}
for(int i=0;i<n;i++){
for(int l=0;l<n;l++)aux2[l]=R[l];
int p1=0,p2=n-1;
int x=tryCombination(aux2);z=1;
while(abs(p1-p2)!=1){
int p3=(p1+p2)/2;
if(z){
for(int l=p1;l<p3;l++){
if(P[l]==0){
aux2[l]=0;
}
}}else{
for(int l=p3;l<=p2;l++){
if(P[l]==0){
aux2[l]=1;
}
}
}
int y=tryCombination(aux2);
if(x>i && y>i){
p1=p3;
z=1;
}else{
p2=p3-1;
z=0;
}
x=y;
}
if(aux2[p2]==1){aux2[p2]=0;}
else aux2[p2]=1;
if(tryCombination(aux2)<i+1){
if(aux2[p2]==1){aux2[p2]=0;}
else aux2[p2]=1;
R[p2]=aux2[p2];
P[p2]=i+1;
}else{
R[p1]=aux2[p1];
P[p1]=i+1;
}
}
answer(R,P);
}
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... |