Submission #1178332

#TimeUsernameProblemLanguageResultExecution timeMemory
1178332vyaductCave (IOI13_cave)C++20
12 / 100
13 ms328 KiB
#include "cave.h" void exploreCave(int N) { int S[N], D[N]; for (int i=0;i<N;i++){ S[i] = 0; D[i] = i; } for (int i=0;i<N;i++){ int ans = tryCombination(S); if (ans == i) S[i] = 1; } 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...