Submission #230277

#TimeUsernameProblemLanguageResultExecution timeMemory
230277Amy313Cave (IOI13_cave)C++14
0 / 100
13 ms384 KiB
#include "cave.h" using namespace std; void exploreCave(int N) { int S[N]; int D[N]; for(int i=0; i<N; i++) { S[i] = 0; D[i] = 1; } for(int i=0; i<N; i++) { int x =tryCombination(S); if(x==-1)break; if(x==i)S[i]=1; } 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...