| # | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 871170 | 2023-11-10T07:35:44 Z | Lib | Rarest Insects (IOI22_insects) | C++17 | 98 ms | 848 KB |
#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=0;
int CurrentInMachine=0;
int PossibleMincount(int cnt){
PrevIndex.clear();
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();
}
}
}
CurrentInMachine=0;
for(int i=0;i<n;i++){
CurrentInMachine+=InMachine[Permutation[i]];
}
if(CurrentInMachine<cnt*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.front()]=0;
move_outside(PrevIndex.front());
PrevIndex.pop_front();
}
return 0;
}else if(CurrentInMachine==cnt*TypeCount){
//As every type of insects has at least cnt insects, the answer is at least cnt. Just return true
PrevIndex.clear();
for(int i=1;i<=cnt;i++){
ok[i]=1;
}
return 1;
}
}
int min_cardinality(int 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;
}
PrevIndex.clear();
int l,r,mid;
n=N;
l=1;
//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);
//Phase 2: Binary search for the answer
//return press_button();
while(r-l>1){
mid=(l+r)/2;
if(PossibleMincount(mid)){
l=mid;
}else{
r=mid-1;
}
}
if(PossibleMincount(r)){
return r;
}else{
return l;
}
}
Compilation message
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 1 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 | 3 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 | 2 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 | 3 ms | 344 KB | Output is correct |
| 18 | Correct | 3 ms | 344 KB | Output is correct |
| 19 | Correct | 3 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 | 1 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 | 3 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 | 2 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 | 3 ms | 344 KB | Output is correct |
| 18 | Correct | 3 ms | 344 KB | Output is correct |
| 19 | Correct | 3 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 | 13 ms | 456 KB | Output is correct |
| 24 | Correct | 4 ms | 460 KB | Output is correct |
| 25 | Correct | 13 ms | 456 KB | Output is correct |
| 26 | Correct | 17 ms | 460 KB | Output is correct |
| 27 | Correct | 36 ms | 344 KB | Output is correct |
| 28 | Correct | 8 ms | 460 KB | Output is correct |
| 29 | Correct | 36 ms | 600 KB | Output is correct |
| 30 | Correct | 30 ms | 604 KB | Output is correct |
| 31 | Correct | 13 ms | 460 KB | Output is correct |
| 32 | Correct | 12 ms | 600 KB | Output is correct |
| 33 | Correct | 13 ms | 600 KB | Output is correct |
| 34 | Correct | 21 ms | 452 KB | Output is correct |
| 35 | Correct | 12 ms | 600 KB | Output is correct |
| 36 | Correct | 17 ms | 460 KB | Output is correct |
| 37 | Correct | 17 ms | 600 KB | Output is correct |
| 38 | Correct | 20 ms | 448 KB | Output is correct |
| 39 | Correct | 12 ms | 344 KB | Output is correct |
| 40 | Correct | 6 ms | 600 KB | Output is correct |
| 41 | Correct | 6 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 | 27 ms | 436 KB | Output is correct |
| 8 | Correct | 9 ms | 604 KB | Output is correct |
| 9 | Partially correct | 30 ms | 456 KB | Output is partially correct |
| 10 | Partially correct | 34 ms | 448 KB | Output is partially correct |
| 11 | Partially correct | 98 ms | 344 KB | Output is partially correct |
| 12 | Correct | 17 ms | 344 KB | Output is correct |
| 13 | Partially correct | 89 ms | 436 KB | Output is partially correct |
| 14 | Partially correct | 57 ms | 848 KB | Output is partially correct |
| 15 | Partially correct | 28 ms | 344 KB | Output is partially correct |
| 16 | Partially correct | 29 ms | 592 KB | Output is partially correct |
| 17 | Partially correct | 27 ms | 592 KB | Output is partially correct |
| 18 | Partially correct | 28 ms | 432 KB | Output is partially correct |
| 19 | Partially correct | 29 ms | 452 KB | Output is partially correct |
| 20 | Partially correct | 32 ms | 456 KB | Output is partially correct |
| 21 | Partially correct | 45 ms | 600 KB | Output is partially correct |
| 22 | Partially correct | 29 ms | 344 KB | Output is partially correct |
| 23 | Partially correct | 35 ms | 600 KB | Output is partially correct |
| 24 | Correct | 27 ms | 600 KB | Output is correct |
| 25 | Correct | 16 ms | 692 KB | Output is correct |
| 26 | Correct | 12 ms | 600 KB | Output is correct |
| 27 | Partially correct | 27 ms | 440 KB | Output is partially correct |
| 28 | Partially correct | 31 ms | 600 KB | Output is partially correct |
| 29 | Partially correct | 26 ms | 432 KB | Output is partially correct |
| 30 | Partially correct | 27 ms | 600 KB | Output is partially correct |
| 31 | Partially correct | 35 ms | 600 KB | Output is partially correct |
| 32 | Partially correct | 32 ms | 600 KB | Output is partially correct |
| 33 | Partially correct | 40 ms | 688 KB | Output is partially correct |
| 34 | Partially correct | 49 ms | 596 KB | Output is partially correct |
| 35 | Partially correct | 29 ms | 456 KB | Output is partially correct |
| 36 | Partially correct | 27 ms | 592 KB | Output is partially correct |
| 37 | Partially correct | 34 ms | 592 KB | Output is partially correct |
| 38 | Partially correct | 33 ms | 600 KB | Output is partially correct |
| 39 | Partially correct | 31 ms | 344 KB | Output is partially correct |
| 40 | Partially correct | 27 ms | 592 KB | Output is partially correct |
| 41 | Partially correct | 28 ms | 592 KB | Output is partially correct |
| 42 | Partially correct | 29 ms | 440 KB | Output is partially correct |
| 43 | Partially correct | 15 ms | 344 KB | Output is partially correct |
| 44 | Partially correct | 77 ms | 344 KB | Output is partially correct |
| 45 | Correct | 25 ms | 448 KB | Output is correct |
| 46 | Correct | 18 ms | 600 KB | Output is correct |
| 47 | Correct | 12 ms | 344 KB | Output is correct |
| 48 | Correct | 13 ms | 460 KB | Output is correct |