#include "insects.h"
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const double r = 0.45;
int min_cardinality(int N)
{
vector<int> remain;
int g = 0;
{
vector<int> single;
for (int i = 0; i < N; i++)
{
move_inside(i);
if (press_button() == 2)
move_outside(i);
else
single.emplace_back(i), g++;
}
for (int i : single)
move_outside(i);
}
int L = 1, R = N / g;
for (int i = 0; i < N; i++)
remain.emplace_back(i);
int lazy = 0;
while (L < R)
{
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
shuffle(remain.begin(), remain.end(), rd);
int k = L * (1.0 - r) + R * r;
vector<int> small, large;
for (int i : remain)
{
if (small.size() + lazy == g * (k + 1))
large.emplace_back(i);
move_inside(i);
if (press_button() > k + 1)
{
move_outside(i);
large.emplace_back(i);
}
else
small.emplace_back(i);
}
if (small.size() + lazy == g * (k + 1))
L = k + 1, remain = large, lazy = g * (k + 1);
else
{
for (int i : small)
move_outside(i);
R = k, remain = small;
}
}
return L;
}
Compilation message
insects.cpp: In function 'int min_cardinality(int)':
insects.cpp:38:37: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
38 | if (small.size() + lazy == g * (k + 1))
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
insects.cpp:49:33: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
49 | if (small.size() + lazy == g * (k + 1))
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
208 KB |
Output is correct |
2 |
Correct |
0 ms |
208 KB |
Output is correct |
3 |
Correct |
0 ms |
208 KB |
Output is correct |
4 |
Correct |
0 ms |
208 KB |
Output is correct |
5 |
Correct |
0 ms |
208 KB |
Output is correct |
6 |
Incorrect |
6 ms |
208 KB |
Wrong answer. |
7 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
208 KB |
Output is correct |
2 |
Correct |
0 ms |
208 KB |
Output is correct |
3 |
Correct |
0 ms |
208 KB |
Output is correct |
4 |
Correct |
0 ms |
208 KB |
Output is correct |
5 |
Correct |
0 ms |
208 KB |
Output is correct |
6 |
Incorrect |
6 ms |
208 KB |
Wrong answer. |
7 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
208 KB |
Output is correct |
2 |
Correct |
0 ms |
208 KB |
Output is correct |
3 |
Correct |
0 ms |
208 KB |
Output is correct |
4 |
Correct |
0 ms |
208 KB |
Output is correct |
5 |
Correct |
0 ms |
208 KB |
Output is correct |
6 |
Incorrect |
0 ms |
208 KB |
Wrong answer. |
7 |
Halted |
0 ms |
0 KB |
- |