Submission #1127734

#TimeUsernameProblemLanguageResultExecution timeMemory
1127734PakinDioxideCave (IOI13_cave)C++17
13 / 100
9 ms328 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); // SUBTASK 2 int idx = 0, a[n] = {}, b[n] = {}; for (int i = 0; i < n; i++) { a[i] = 1; b[i] = tryCombination(a); a[i] = 0; } 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...