Submission #456244

#TimeUsernameProblemLanguageResultExecution timeMemory
456244KhizriCave (IOI13_cave)C++17
13 / 100
44 ms400 KiB
#include "cave.h" int arr[5005],a[5005],b[5005]; void exploreCave(int n) { //tryCombination(int S[]) for(int i=0;i<n;i++){ if(i==n-1){ a[i]=0; int l=tryCombination(a); a[i]=1; int r=tryCombination(a); if(l==-1){ b[i]=r; a[i]=0; } else{ b[i]=l; a[i]=1; } break; } a[i]=0; int q=tryCombination(a); if(q==-1){ a[i]=1; b[i]=tryCombination(a); a[i]=0; } else{ bool r=false; for(int j=i+1;j<n;j++){ a[j]=1; int x=tryCombination(a); a[j]=0; if(x!=q){ r=true; break; } } if(!r){ b[i]=q; a[i]=1; } else{ a[i]=1; b[i]=tryCombination(a); a[i]=0; } } } 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...