# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
352432 | 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];}
int T()return tryCombination(c)+8192&8191;
void exploreCave(int N){
for(;i<N;i++){
l=0,r=N-1;
if(T(c)>i)A(r);
while(l<=r){
m=l+r>>1;
A(m);
T(c)>i?a[i]=m,A(m),r=m-1:A(m),l=m+1;
}
f[a[i]]=1;
}
answer(c,a);
}