# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
354311 | 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,e;
void A(int L,int R){for(;R>=L;R--)c[R]^=(!f[R]);}
int T(){e=tryCombination(c);return e<=i&&e!=1;}
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{A(m);l=m+1;}}
a[l]=i,f[l]=1;
}answer(c,a);
}