#include "insects.h"
#include <vector>
#include <random>
#include <algorithm>
using namespace std;
mt19937 rnd(4312);
int color[2005];
int min_cardinality(int N)
{
int tarbqan = 0;
vector<int> mej;
for (int i = 0; i < N; i++)
{
move_inside(i);
if (press_button() != 1)
{
move_outside(i);
}
else
mej.push_back(i);
}
tarbqan = mej.size();
if (tarbqan == 1)
{
return N;
}
for (int i = 0; i < mej.size(); i++)
{
move_outside(mej[i]);
}
mej.clear();
int l = 1, r = N / tarbqan, ans = 0;
int verjivichak = 0;
while (l <= r)
{
int m = (l + r) / 2;
int x;
if (verjivichak == 0)
{
for (int i = 0; i < N; i++)
{
if (color[i] == 0)
{
move_inside(i);
if (press_button() > m)
{
move_outside(i);
}
else
{
color[i] = 1;
mej.push_back(i);
}
}
}
}
else
{
shuffle(mej.begin(), mej.begin(), rnd);
while (press_button() > m)
{
color[mej.back()] = 2;
move_outside(mej.back());
mej.pop_back();
}
for (int i = 0; i < N; i++)
{
if (color[i] == 2)
{
move_inside(i);
if (press_button() > m)
{
move_outside(i);
color[i] = 0;
}
else
{
color[i] = 1;
}
}
}
}
if (mej.size() == tarbqan * m)
{
verjivichak = 0;
l = m + 1;
ans = m;
}
else
{
verjivichak = 1;
r = m - 1;
m = (l + r) / 2;
}
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |