Submission #823009

#TimeUsernameProblemLanguageResultExecution timeMemory
823009finn__Rarest Insects (IOI22_insects)C++17
0 / 100
85 ms304 KiB
#include <bits/stdc++.h> #include "insects.h" std::bitset<2000> in_machine; int min_cardinality(int N) { move_inside(0); in_machine[0] = 1; int d = 1; for (int i = 1; i < N; ++i) { move_inside(i); if (press_button() > 1) move_outside(i); else ++d, in_machine[i] = 1; } while (1) { int const bound = N / d; std::vector<int> moved; int inside = in_machine.count(); for (int i = 0; i < N && inside < d * bound; ++i) if (!in_machine[i]) { move_inside(i); if (press_button() > bound) move_outside(i); else in_machine[i] = 1, moved.push_back(i), ++inside; } if (inside == d * bound) { return bound; } else { N = inside; for (auto const &i : moved) in_machine[i] = 0, move_outside(i); } } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...