Submission #508842

#TimeUsernameProblemLanguageResultExecution timeMemory
508842tabrCave (IOI13_cave)C++17
0 / 100
141 ms396 KiB
#include <bits/stdc++.h> using namespace std; #ifdef tabr #include "library/debug.cpp" #else #define debug(...) #endif #include "cave.h" void exploreCave(int n) { int a[5000] = {}; int b[5000] = {}; vector<int> c; for (int i = 0; i < n; i++) { c.emplace_back(i); } for (int i = 0; i < n; i++) { for (int j : c) { a[j] = 0; } int k = 0; if (tryCombination(a) != i) { k = 1; } int lo = 0; int hi = n - i; while (hi - lo > 1) { int mid = (hi + lo) / 2; for (int j = 0; j < n - i; j++) { if (j < mid) { a[j] = k; } else { a[j] = k ^ 1; } } if (tryCombination(a) == i) { hi = mid; } else { lo = mid; } } a[lo] = k; b[i] = lo; c.erase(c.begin() + lo); } 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...