Submission #166701

#TimeUsernameProblemLanguageResultExecution timeMemory
166701samsCave (IOI13_cave)C++14
25 / 100
28 ms512 KiB
#include "cave.h" void exploreCave(int N) { int S[N+1]; int D[N+1]; for(int i = 0 ; i < N ; ++i) S[i] = 0, D[i] = i; int val = tryCombination(S); if(val == -1) { for(int i = 0 ; i < N ; ++i) { S[i] = 1; int s = tryCombination(S); //printf("%d\n", s); D[i] = s; S[i] = 0; } } else { while(val != -1) { S[val] = !S[val]; val = 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...