Submission #306409

#TimeUsernameProblemLanguageResultExecution timeMemory
306409amunduzbaevCave (IOI13_cave)C++14
0 / 100
27 ms512 KiB
#include "cave.h" #include <bits/stdc++.h> using namespace std; int s[5005],d[5005],ret; bool used[5005],prevdopen,dopen; void exploreCave(int n) { memset(s,0,sizeof(s)); for(int i=0;i<n-1;i++){ if(ret==-1||ret>i) prevdopen=1; else prevdopen=0; int l=0,r=n-1; while(l<r){ int m=(l+r)/2; for(int i=l;i<=m;i++){ if(used[i]) continue; s[i]=!s[i]; } ret=tryCombination(s); if(ret==-1||ret>i) dopen=1; else dopen=0; if(dopen==prevdopen) l=m+1; else r=m; prevdopen=dopen; } d[l]=i; used[i]=1; if(!dopen){ s[l]=!s[l]; ret=tryCombination(s); } } answer(s,d); }
#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...