Submission #1218733

#TimeUsernameProblemLanguageResultExecution timeMemory
1218733laurraCave (IOI13_cave)C++20
33 / 100
103 ms528 KiB
#include <iostream> #include "cave.h" using namespace std; void exploreCave(int N) { int i,j,rasp,S[N],D[N],fr[N]; for(i=0;i<N;i++) { D[i]=S[i]=0; fr[i]=0; } for(i=0;i<N;i++) { rasp=tryCombination(S); if(rasp!=i) { for(j=0;j<N;j++) { if(fr[j]==0) { S[j]=1-S[j]; if(tryCombination(S)==i) { D[j]=i; S[j]=1-S[j]; fr[j]=1; break; } S[j]=1-S[j]; } } } else { for(j=0;j<N;j++) { if(fr[j]==0) { S[j]=1-S[j]; if(tryCombination(S)!=i) { D[j]=i; fr[j]=1; break; } S[j]=1-S[j]; } } } } 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...