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