Submission #1127733

#TimeUsernameProblemLanguageResultExecution timeMemory
1127733PakinDioxideCave (IOI13_cave)C++17
12 / 100
9 ms516 KiB
#include "cave.h" #include <bits/stdc++.h> using namespace std; void exploreCave(int n) { // SUBTASK 1 int idx = 0, a[n] = {}, b[n]; for (int i = 0; i < n; i++) b[i] = i; while ((idx = tryCombination(a)) != -1) { a[idx] = 1; } answer(a, b); }
#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...