#include "insects.h"
#include <bits/stdc++.h>
using namespace std;
int min_cardinality(int N){
mt19937 rng(chrono::steady_clock().now().time_since_epoch().count());
vector<int> ord;
for(int i = 0;i<N;i++){
ord.push_back(i);
}
shuffle(ord.begin(),ord.end(),rng);
vector<int> v;
int now = 0;
int dif = 0;
auto add = [&](int x){
v.push_back(ord[x]);
move_inside(ord[x]);
now = press_button();
};
auto del = [&](){
move_outside(v.back());
v.pop_back();
now = press_button();
};
auto del2 = [&](){
move_outside(v.back());
v.pop_back();
now--;
};
auto del3 = [&](){
move_outside(v.back());
v.pop_back();
};
add(0);
dif = 1;
for(int i = 1;i<N;i++){
add(i);
if(now == 2){
del2();
}
else dif++;
}
if(dif == 1)
return N;
if(dif == 2){
for(int i = 0;i<N;i++){
if(find(v.begin(),v.end(),i) == v.end()){
add(i);
}
}
return N - now;
}
if(dif <= 9){
vector<bool> found(N,0);
int mini = 1e9;
for(int i = 0;i<N;i++){
if(found[i] == 0){
while(v.size())
del2();
now = 0;
int cnt = 0;
for(int j = 0;j<N;j++){
if(found[j])continue;
add(j);
if(now != cnt + 1){
del3();
}
else{
found[j] = 1;
cnt++;
}
}
mini = min(mini,cnt);
}
}
return mini;
}
int l = 1,r = N/dif;
while(l < r){
int m = (l + r + 1)/2;
int tmp = now;
press_button();
assert(now == tmp);
if(now < m){
for(int i = 0;i<N;i++){
if(find(v.begin(),v.end(),i) == v.end()){
add(i);
if(now > m)
del2();
}
}
}
else{
while(now > m){
del();
}
for(int i = 0;i<N;i++){
if(find(v.begin(),v.end(),i) == v.end()){
add(i);
if(now > m)
del2();
}
}
}
if(v.size() == m * dif){
l = m;
}
else r = m -1;
}
return l;
}
Compilation message
insects.cpp: In function 'int min_cardinality(int)':
insects.cpp:105:15: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
105 | if(v.size() == m * dif){
| ~~~~~~~~~^~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
208 KB |
Output is correct |
| 2 |
Correct |
0 ms |
208 KB |
Output is correct |
| 3 |
Incorrect |
0 ms |
208 KB |
Wrong answer. |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
208 KB |
Output is correct |
| 2 |
Correct |
0 ms |
208 KB |
Output is correct |
| 3 |
Incorrect |
0 ms |
208 KB |
Wrong answer. |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
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 |
Incorrect |
1 ms |
208 KB |
Wrong answer. |
| 6 |
Halted |
0 ms |
0 KB |
- |
