Submission #354313

#TimeUsernameProblemLanguageResultExecution timeMemory
354313David_MCave (IOI13_cave)C++14
0 / 100
112 ms492 KiB
#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){ memset(f,0,sizeof(f)); memset(a,0,sizeof(a)); memset(c,0,sizeof(c)); for(;i<N;i++){ if(T())A(0,N-1); l=0,r=N-1; while(l<r){ m=(l+r)/2; A(l,m); e=T(); A(l,m); if(e) r=m; else l=m+1; } a[l]=i,f[l]=1; }answer(c,a); }
#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...