# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
876999 | AlphaMale06 | Cave (IOI13_cave) | C++14 | 125 ms | 604 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<bits/stdc++.h>
#include "cave.h"
using namespace std;
void exploreCave(int n){
bool know[n];
int p[n], ans[n], comb[n];
for(int i=0; i< n; i++){
know[i]=ans[i]=0;
}
for(int i=0; i< n; i++){
for(int j=0; j< n; j++)comb[j]=ans[j];
int l=0; int r=n-1;
int prev=tryCombination(comb);
while(l<r){
int s=(l+r)/2;
for(int j=l; j<=s; j++){
if(!know[j])comb[j]=1-comb[j];
}
int ans1=tryCombination(comb);
if(ans1==prev)l=s+1;
else r=s;
prev=ans1;
}
know[l]=1;
p[i]=l;
if(prev==i)ans[l]=1-comb[l];
else ans[l]=comb[l];
}
answer(ans, 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... |