Submission #382318

#TimeUsernameProblemLanguageResultExecution timeMemory
382318Andyvanh1Cave (IOI13_cave)C++14
0 / 100
367 ms460 KiB
#include <iostream> #include <vector> #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] = i+1; } int k = 0; while(k<n){ k = tryCombination(S); S[k] = 1-S[k]; } 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...