# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
354334 | David_M | Cave (IOI13_cave) | C++14 | 281 ms | 680 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 c[5003],f[5003],a[5003],i,j,x,l,r,m;void A(int R){for(;R>=l;R--)c[R]^=!f[R];}int T(){return(tryCombination(c)+9999)%9999<=i;}void exploreCave(int N){for(;i<N;i++){l=0,r=N-1;if(T())A(r);while(l<r){m=l+r>>1;A(m);if(T())r=m,A(m);else l=m+1;}a[l]=i,f[l]=1;}answer(c,a);}
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... |