Submission #590000

#TimeUsernameProblemLanguageResultExecution timeMemory
590000shezittCave (IOI13_cave)C++14
25 / 100
25 ms468 KiB
#include "cave.h" #include <iostream> #include <algorithm> #include <cstring> void exploreCave(int N) { int a[N]; for(int i=0; i<N; ++i){ a[i] = 0; } int p = tryCombination(a); while(p != -1){ a[p] = !a[p]; p = tryCombination(a); } int b[N]; for(int i=0; i<N; ++i){ a[i] = !a[i]; b[i] = tryCombination(a); a[i] = !a[i]; } 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...