Submission #280736

#TimeUsernameProblemLanguageResultExecution timeMemory
280736jairRSCave (IOI13_cave)C++17
12 / 100
15 ms512 KiB
#include "cave.h" #include <vector> using namespace std; void exploreCave(int N) { int combination[5000]; int firstClosed = tryCombination(combination); while (firstClosed != -1) { combination[firstClosed] = 1; firstClosed = tryCombination(combination); } int switches[5000]; for (int i = 0; i < N; i++) { switches[i] = i; } answer(combination, switches); }
#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...