Submission #822969

#TimeUsernameProblemLanguageResultExecution timeMemory
822969finn__Rarest Insects (IOI22_insects)C++17
48.13 / 100
167 ms416 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;
    }

    int a = 1, b = N;
    while (a < b)
    {
        int const mid = (a + b + 1) >> 1;
        std::vector<int> moved;

        int inside = in_machine.count();
        for (int i = 0; i < N && inside < d * mid; ++i)
            if (!in_machine[i])
            {
                move_inside(i);
                if (press_button() > mid)
                    move_outside(i);
                else
                    in_machine[i] = 1, moved.push_back(i), ++inside;
            }

        if (inside == d * mid)
        {
            a = mid;
        }
        else
        {
            b = mid - 1;
            for (auto const &i : moved)
                in_machine[i] = 0, move_outside(i);
        }
    }

    return a;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...