#include <bits/stdc++.h>
#include "insects.h"
//#include "stub.cpp"
using namespace std;
deque <int> PrevIndex;
int InMachine[2003];
int Permutation[2003];
//saving the answer of each iteration so that we won't accidentially binsearch something we've already calculated
int ok[2003];
int n;
int TypeCount;
int CurrentInMachine;
int l,r,mid;
int PossibleMincount(int cnt){
while(!PrevIndex.empty()){
PrevIndex.pop_back();
}
if(ok[cnt]){
return 1;
}
//Pushing insects inside the machine, keeping track of the ones being putted inside for this iteration of binary searching
for(int i=0;i<n;i++){
if(!InMachine[Permutation[i]]){
InMachine[Permutation[i]]=1;
move_inside(Permutation[i]);
PrevIndex.push_back(Permutation[i]);
if(press_button()>cnt){
move_outside(Permutation[i]);
InMachine[Permutation[i]]=0;
PrevIndex.pop_back();
}
if(PrevIndex.size()==(cnt-l)*TypeCount){
break;
}
}
}
if(PrevIndex.size()!=(cnt-l)*TypeCount){
//There clearly exist a type of insect with cardinality less than cnt, so the answer is less than cnt. Removing insects from last iteration.
while(!PrevIndex.empty()){
InMachine[PrevIndex.back()]=0;
move_outside(PrevIndex.back());
PrevIndex.pop_back();
}
PrevIndex.clear();\
CurrentInMachine=0;
for(int i=0;i<n;i++){
CurrentInMachine+=InMachine[Permutation[i]];
}
return 0;
}else{
//As every type of insects has at least cnt insects, the answer is at least cnt. Just return true
while(!PrevIndex.empty()){
PrevIndex.pop_back();
}
CurrentInMachine=0;
for(int i=0;i<n;i++){
CurrentInMachine+=InMachine[Permutation[i]];
}
return 1;
}
}
int min_cardinality(int N){
n=N;
//Create a random permutation to fuck with shitty tests and achieve better query efficiency
for(int i=0;i<N;i++){
Permutation[i]=i;
}
srand(time(NULL));
int Tempval;
for(int i=N-1;i>0;i--){
Tempval=rand()%i;
swap(Permutation[i],Permutation[Tempval]);
}
//Remember to initialize as this is multitest
for(int i=0;i<N;i++){
InMachine[Permutation[i]]=0;
ok[i+1]=0;
}
while(!PrevIndex.empty()){
PrevIndex.pop_back();
}
//Phase 1: Determining the amount of different types of insects
for(int i=0;i<n;i++){
move_inside(Permutation[i]);
InMachine[Permutation[i]]=1;
PrevIndex.push_back(Permutation[i]);
if(press_button()>1){
move_outside(Permutation[i]);
InMachine[Permutation[i]]=0;
PrevIndex.pop_back();
}
}
TypeCount=PrevIndex.size();
r=(N/TypeCount);
l=1;
//Phase 2: Binary search for the answer
while(r-l>=1){
mid=(l+r+1)/2;
if(PossibleMincount(mid)){
l=mid;
// r=mid+(N-CurrentInMachine)/TypeCount+1;
}else{
r=mid-1;
}
}
if(ok[r]){
return r;
}else{
return l;
}
}
Compilation message
insects.cpp: In function 'int PossibleMincount(int)':
insects.cpp:34:23: warning: comparison of integer expressions of different signedness: 'std::deque<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
34 | if(PrevIndex.size()==(cnt-l)*TypeCount){
| ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
insects.cpp:39:21: warning: comparison of integer expressions of different signedness: 'std::deque<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
39 | if(PrevIndex.size()!=(cnt-l)*TypeCount){
| ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
344 KB |
Output is correct |
| 3 |
Correct |
0 ms |
344 KB |
Output is correct |
| 4 |
Correct |
0 ms |
344 KB |
Output is correct |
| 5 |
Correct |
0 ms |
344 KB |
Output is correct |
| 6 |
Correct |
2 ms |
344 KB |
Output is correct |
| 7 |
Correct |
1 ms |
344 KB |
Output is correct |
| 8 |
Correct |
2 ms |
344 KB |
Output is correct |
| 9 |
Correct |
4 ms |
344 KB |
Output is correct |
| 10 |
Correct |
6 ms |
344 KB |
Output is correct |
| 11 |
Correct |
1 ms |
344 KB |
Output is correct |
| 12 |
Correct |
5 ms |
344 KB |
Output is correct |
| 13 |
Correct |
3 ms |
344 KB |
Output is correct |
| 14 |
Correct |
3 ms |
344 KB |
Output is correct |
| 15 |
Correct |
2 ms |
344 KB |
Output is correct |
| 16 |
Correct |
2 ms |
344 KB |
Output is correct |
| 17 |
Correct |
2 ms |
344 KB |
Output is correct |
| 18 |
Correct |
4 ms |
344 KB |
Output is correct |
| 19 |
Correct |
2 ms |
344 KB |
Output is correct |
| 20 |
Correct |
2 ms |
344 KB |
Output is correct |
| 21 |
Correct |
1 ms |
344 KB |
Output is correct |
| 22 |
Correct |
1 ms |
344 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
344 KB |
Output is correct |
| 3 |
Correct |
0 ms |
344 KB |
Output is correct |
| 4 |
Correct |
0 ms |
344 KB |
Output is correct |
| 5 |
Correct |
0 ms |
344 KB |
Output is correct |
| 6 |
Correct |
2 ms |
344 KB |
Output is correct |
| 7 |
Correct |
1 ms |
344 KB |
Output is correct |
| 8 |
Correct |
2 ms |
344 KB |
Output is correct |
| 9 |
Correct |
4 ms |
344 KB |
Output is correct |
| 10 |
Correct |
6 ms |
344 KB |
Output is correct |
| 11 |
Correct |
1 ms |
344 KB |
Output is correct |
| 12 |
Correct |
5 ms |
344 KB |
Output is correct |
| 13 |
Correct |
3 ms |
344 KB |
Output is correct |
| 14 |
Correct |
3 ms |
344 KB |
Output is correct |
| 15 |
Correct |
2 ms |
344 KB |
Output is correct |
| 16 |
Correct |
2 ms |
344 KB |
Output is correct |
| 17 |
Correct |
2 ms |
344 KB |
Output is correct |
| 18 |
Correct |
4 ms |
344 KB |
Output is correct |
| 19 |
Correct |
2 ms |
344 KB |
Output is correct |
| 20 |
Correct |
2 ms |
344 KB |
Output is correct |
| 21 |
Correct |
1 ms |
344 KB |
Output is correct |
| 22 |
Correct |
1 ms |
344 KB |
Output is correct |
| 23 |
Correct |
9 ms |
600 KB |
Output is correct |
| 24 |
Correct |
4 ms |
600 KB |
Output is correct |
| 25 |
Correct |
12 ms |
600 KB |
Output is correct |
| 26 |
Correct |
19 ms |
456 KB |
Output is correct |
| 27 |
Correct |
42 ms |
344 KB |
Output is correct |
| 28 |
Correct |
3 ms |
344 KB |
Output is correct |
| 29 |
Correct |
36 ms |
460 KB |
Output is correct |
| 30 |
Correct |
28 ms |
600 KB |
Output is correct |
| 31 |
Correct |
11 ms |
600 KB |
Output is correct |
| 32 |
Correct |
11 ms |
600 KB |
Output is correct |
| 33 |
Correct |
14 ms |
344 KB |
Output is correct |
| 34 |
Correct |
16 ms |
600 KB |
Output is correct |
| 35 |
Correct |
12 ms |
600 KB |
Output is correct |
| 36 |
Correct |
13 ms |
600 KB |
Output is correct |
| 37 |
Correct |
14 ms |
460 KB |
Output is correct |
| 38 |
Correct |
14 ms |
600 KB |
Output is correct |
| 39 |
Correct |
9 ms |
344 KB |
Output is correct |
| 40 |
Correct |
6 ms |
456 KB |
Output is correct |
| 41 |
Correct |
4 ms |
600 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
344 KB |
Output is correct |
| 3 |
Correct |
0 ms |
344 KB |
Output is correct |
| 4 |
Correct |
0 ms |
344 KB |
Output is correct |
| 5 |
Correct |
0 ms |
344 KB |
Output is correct |
| 6 |
Correct |
0 ms |
344 KB |
Output is correct |
| 7 |
Correct |
18 ms |
456 KB |
Output is correct |
| 8 |
Correct |
11 ms |
688 KB |
Output is correct |
| 9 |
Correct |
23 ms |
344 KB |
Output is correct |
| 10 |
Partially correct |
33 ms |
344 KB |
Output is partially correct |
| 11 |
Partially correct |
87 ms |
692 KB |
Output is partially correct |
| 12 |
Correct |
13 ms |
600 KB |
Output is correct |
| 13 |
Partially correct |
97 ms |
688 KB |
Output is partially correct |
| 14 |
Partially correct |
44 ms |
704 KB |
Output is partially correct |
| 15 |
Correct |
20 ms |
592 KB |
Output is correct |
| 16 |
Correct |
24 ms |
592 KB |
Output is correct |
| 17 |
Correct |
22 ms |
344 KB |
Output is correct |
| 18 |
Correct |
29 ms |
456 KB |
Output is correct |
| 19 |
Correct |
25 ms |
436 KB |
Output is correct |
| 20 |
Correct |
25 ms |
436 KB |
Output is correct |
| 21 |
Partially correct |
36 ms |
692 KB |
Output is partially correct |
| 22 |
Partially correct |
43 ms |
688 KB |
Output is partially correct |
| 23 |
Partially correct |
36 ms |
592 KB |
Output is partially correct |
| 24 |
Correct |
23 ms |
600 KB |
Output is correct |
| 25 |
Correct |
16 ms |
600 KB |
Output is correct |
| 26 |
Correct |
8 ms |
344 KB |
Output is correct |
| 27 |
Correct |
23 ms |
592 KB |
Output is correct |
| 28 |
Correct |
23 ms |
436 KB |
Output is correct |
| 29 |
Correct |
23 ms |
600 KB |
Output is correct |
| 30 |
Correct |
26 ms |
440 KB |
Output is correct |
| 31 |
Partially correct |
34 ms |
592 KB |
Output is partially correct |
| 32 |
Partially correct |
33 ms |
344 KB |
Output is partially correct |
| 33 |
Partially correct |
41 ms |
592 KB |
Output is partially correct |
| 34 |
Partially correct |
39 ms |
708 KB |
Output is partially correct |
| 35 |
Correct |
22 ms |
344 KB |
Output is correct |
| 36 |
Correct |
19 ms |
592 KB |
Output is correct |
| 37 |
Partially correct |
39 ms |
592 KB |
Output is partially correct |
| 38 |
Partially correct |
32 ms |
344 KB |
Output is partially correct |
| 39 |
Correct |
21 ms |
592 KB |
Output is correct |
| 40 |
Correct |
23 ms |
592 KB |
Output is correct |
| 41 |
Correct |
21 ms |
592 KB |
Output is correct |
| 42 |
Correct |
21 ms |
592 KB |
Output is correct |
| 43 |
Partially correct |
15 ms |
344 KB |
Output is partially correct |
| 44 |
Partially correct |
70 ms |
344 KB |
Output is partially correct |
| 45 |
Correct |
16 ms |
600 KB |
Output is correct |
| 46 |
Correct |
12 ms |
600 KB |
Output is correct |
| 47 |
Correct |
14 ms |
600 KB |
Output is correct |
| 48 |
Correct |
13 ms |
600 KB |
Output is correct |
