Submission #261529

#TimeUsernameProblemLanguageResultExecution timeMemory
261529c4ts0up동굴 (IOI13_cave)C++17
12 / 100
11 ms512 KiB
#include "cave.h" #include <bits/stdc++.h> /* ID: c4ts0up LANG: C++ TASK: cave */ const int NMAX = 5005; int S[NMAX], D[NMAX]; void exploreCave(int n) { // disposicion inical for (int i=0; i<n; i++) S[i] = 0; int q = tryCombination(S); while (q != -1) { S[q] = 1; q = tryCombination(S); } // llenamos el D for (int i=0; i<n; i++) D[i] = i; 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...