Submission #16652

#TimeUsernameProblemLanguageResultExecution timeMemory
16652eaststarCave (IOI13_cave)C++14
0 / 100
99 ms512 KiB
#include "cave.h" int a[5010],b[5010],chk[5010]; void exploreCave(int n){ int i,j,s,e,m,t,p; for(i=0;i<n;++i){ t=tryCombination(a); s=0,e=n-1; while(s<e){ m=(s+e)/2; for(j=s;j<=m;++j)if(!chk[j])a[j]=!a[j]; p=t; (p==i)^(t=tryCombination(a)==i)?e=m:s=m+1; } a[s]=!a[s],b[s]=i,chk[s]=1; } answer(a,b); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...