# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
109375 | amiratou | Cave (IOI13_cave) | C++14 | 1238 ms | 640 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>
int ans[5002];
int doors[5002];
void exploreCave(int N) {
memset(ans,-1,sizeof ans);
for (int i = 0; i < N; ++i){
int l=0,r=N-1,state[N],c=0,a;
memset(state,0,sizeof state);
for (int i = 0; i < N; ++i)
if(ans[i]!=-1)state[i]=ans[i];
if(tryCombination(state)==i)c=1;
while(l!=r){
int med=(l+r)/2;
for (int j = l; j <= med; ++j)
state[j]=c;
for (int j = med+1; j <= r; ++j)
state[j]=(1-c);
for (int j = 0; j < N; ++j)
if(ans[j]!=-1)state[j]=ans[j];
int check=tryCombination(state);
if(check==i)l=med+1;
else r=med;
}
ans[l]=c;
doors[l]=i;
}
answer(ans,doors);
}
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... |