Submission #261532

#TimeUsernameProblemLanguageResultExecution timeMemory
261532c4ts0up동굴 (IOI13_cave)C++17
13 / 100
16 ms484 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 final for (int i=0; i<n; i++) S[i] = 0; for (int i=0; i<n; i++) { S[i] = 1; int puerta = tryCombination(S); S[i] = 0; D[i] = puerta; } 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...