Submission #291372

#TimeUsernameProblemLanguageResultExecution timeMemory
291372cig32Cave (IOI13_cave)C++14
21 / 100
79 ms384 KiB
#include "cave.h" #include<bits/stdc++.h> void exploreCave(int N) { int S[N], D[N]; for(int i=0;i<N;i++){ S[i]=0; D[i]=-1; } int prev=tryCombination(S); while(true){ bool ok=true; for(int i=0;i<N;i++){ if(D[i]==-1)ok=false; } if(ok){ answer(S,D); return; } for(int i=0;i<N;i++){ if(D[i]==-1){ S[i]=1-S[i]; int now=tryCombination(S); if(now==-1 || now>prev){ D[i]=prev; prev=now; } else{ S[i]=1-S[i]; } } } } }
#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...