# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
3008 | cki86201 | Cave (IOI13_cave) | C++98 | 348 ms | 544 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"
int D[5050],S[8200];
int u;
bool check[5050];
int solve(int s,int d,int h,bool now)
{
if(h==-1){
now?0:S[s]^=1;
return s;
}
int i;
for(i=(s+d)>>1;i<d;i++){
if(!check[i])S[i]^=1;
}
bool p=(tryCombination(S)!=u);
if(now^p)return solve((s+d)>>1,d,h-1,p);
else return solve(s,(s+d)>>1,h-1,p);
}
void exploreCave(int N) {
int i,j,k;
for(i=0;i<N;i++){
u=i;
int t=solve(0,(1<<13),12,tryCombination(S)!=i);
D[t]=i;
check[t]=1;
}
answer(S,D);
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... |