Submission #589971

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