Submission #872286

# Submission time Handle Problem Language Result Execution time Memory
872286 2023-11-12T17:12:03 Z Lib Rarest Insects (IOI22_insects) C++17
47.57 / 100
113 ms 1364 KB
#include <bits/stdc++.h>
#include "insects.h"
//#include "stub.cpp"
using namespace std;
int l,r,mid;
vector <int> PrevIndexIn,PrevIndexOut,RemainingInsects;
int InMachine[2003];
int n;
int TypeCount=0;
int CurrentInMachine=0;
 
int PossibleMincount(int cnt){
	PrevIndexIn.clear();
	PrevIndexOut.clear();
	//Pushing insects inside the machine, keeping track of the ones being putted inside for this iteration of binary searching
	for(int i=0;i<RemainingInsects.size();i++){
		move_inside(RemainingInsects[i]);
		InMachine[RemainingInsects[i]]=1;
		PrevIndexIn.push_back(RemainingInsects[i]);
		CurrentInMachine++;
		if(press_button()>cnt){
			PrevIndexIn.pop_back();
			PrevIndexOut.push_back(RemainingInsects[i]);
			InMachine[RemainingInsects[i]]=0;
			move_outside(RemainingInsects[i]);
			CurrentInMachine--;
		}
	}
	RemainingInsects.clear();
	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(!PrevIndexIn.empty()){
			InMachine[PrevIndexIn.back()]=0;
			move_outside(PrevIndexIn.back());
			PrevIndexOut.push_back(PrevIndexIn.back());
			PrevIndexIn.pop_back();
			CurrentInMachine--;
		}
		RemainingInsects=PrevIndexOut;
		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
		RemainingInsects=PrevIndexOut;
		PrevIndexIn.clear();
		return 1;
	}
}
 
int min_cardinality(int N){
	//Remember to initialize as this is multitest
	for(int i=0;i<N;i++){
    InMachine[i]=0;
    }
    PrevIndexIn.clear();
    PrevIndexOut.clear();
    RemainingInsects.clear();
	n=N;
	l=1;
	//Phase 1: Determining the amount of different types of insects
	TypeCount=0;
	CurrentInMachine=0;
	for(int i=0;i<n;i++){
		move_inside(i);
		InMachine[i]=1;
		CurrentInMachine++;
		if(press_button()>1){
			move_outside(i);
			InMachine[i]=0;
			CurrentInMachine--;
		}else{
			TypeCount++;
		}
	}
	for(int i=0;i<n;i++){
			if(!InMachine[i]){
				RemainingInsects.push_back(i);
			}
		}
	r=(n);
	//Phase 2: Binary search for the answer
	while(r-l>=1){
		mid=(l+r+1)/2;
		if(PossibleMincount(mid)){
			l=mid;
		}else{
			r=mid-1;
		}
	}
	return l;
}

Compilation message

insects.cpp: In function 'int PossibleMincount(int)':
insects.cpp:16:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 |  for(int i=0;i<RemainingInsects.size();i++){
      |              ~^~~~~~~~~~~~~~~~~~~~~~~~
insects.cpp:47:1: warning: control reaches end of non-void function [-Wreturn-type]
   47 | }
      | ^
# 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 596 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 4 ms 344 KB Output is correct
9 Correct 6 ms 600 KB Output is correct
10 Correct 6 ms 344 KB Output is correct
11 Correct 4 ms 600 KB Output is correct
12 Correct 7 ms 600 KB Output is correct
13 Correct 6 ms 600 KB Output is correct
14 Correct 5 ms 600 KB Output is correct
15 Correct 6 ms 600 KB Output is correct
16 Correct 5 ms 344 KB Output is correct
17 Correct 5 ms 344 KB Output is correct
18 Correct 7 ms 600 KB Output is correct
19 Correct 6 ms 344 KB Output is correct
20 Correct 5 ms 600 KB Output is correct
21 Correct 4 ms 600 KB Output is correct
22 Correct 3 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 596 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 4 ms 344 KB Output is correct
9 Correct 6 ms 600 KB Output is correct
10 Correct 6 ms 344 KB Output is correct
11 Correct 4 ms 600 KB Output is correct
12 Correct 7 ms 600 KB Output is correct
13 Correct 6 ms 600 KB Output is correct
14 Correct 5 ms 600 KB Output is correct
15 Correct 6 ms 600 KB Output is correct
16 Correct 5 ms 344 KB Output is correct
17 Correct 5 ms 344 KB Output is correct
18 Correct 7 ms 600 KB Output is correct
19 Correct 6 ms 344 KB Output is correct
20 Correct 5 ms 600 KB Output is correct
21 Correct 4 ms 600 KB Output is correct
22 Correct 3 ms 344 KB Output is correct
23 Correct 11 ms 600 KB Output is correct
24 Correct 4 ms 344 KB Output is correct
25 Correct 27 ms 856 KB Output is correct
26 Correct 40 ms 1092 KB Output is correct
27 Correct 41 ms 696 KB Output is correct
28 Correct 23 ms 856 KB Output is correct
29 Correct 51 ms 948 KB Output is correct
30 Correct 40 ms 856 KB Output is correct
31 Correct 24 ms 936 KB Output is correct
32 Correct 27 ms 436 KB Output is correct
33 Correct 28 ms 692 KB Output is correct
34 Correct 27 ms 1196 KB Output is correct
35 Correct 33 ms 600 KB Output is correct
36 Correct 31 ms 948 KB Output is correct
37 Correct 38 ms 1096 KB Output is correct
38 Correct 46 ms 856 KB Output is correct
39 Correct 33 ms 1364 KB Output is correct
40 Correct 27 ms 1100 KB Output is correct
41 Correct 21 ms 444 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 Partially correct 0 ms 344 KB Output is partially correct
7 Correct 25 ms 440 KB Output is correct
8 Correct 8 ms 344 KB Output is correct
9 Partially correct 76 ms 912 KB Output is partially correct
10 Partially correct 90 ms 848 KB Output is partially correct
11 Partially correct 98 ms 620 KB Output is partially correct
12 Partially correct 52 ms 688 KB Output is partially correct
13 Partially correct 113 ms 684 KB Output is partially correct
14 Partially correct 104 ms 688 KB Output is partially correct
15 Partially correct 48 ms 1188 KB Output is partially correct
16 Partially correct 63 ms 848 KB Output is partially correct
17 Partially correct 65 ms 848 KB Output is partially correct
18 Partially correct 56 ms 1104 KB Output is partially correct
19 Partially correct 65 ms 680 KB Output is partially correct
20 Partially correct 77 ms 1164 KB Output is partially correct
21 Partially correct 95 ms 920 KB Output is partially correct
22 Partially correct 99 ms 848 KB Output is partially correct
23 Partially correct 94 ms 940 KB Output is partially correct
24 Partially correct 77 ms 712 KB Output is partially correct
25 Partially correct 59 ms 1208 KB Output is partially correct
26 Partially correct 42 ms 1172 KB Output is partially correct
27 Partially correct 64 ms 936 KB Output is partially correct
28 Partially correct 62 ms 936 KB Output is partially correct
29 Partially correct 55 ms 936 KB Output is partially correct
30 Partially correct 56 ms 692 KB Output is partially correct
31 Partially correct 85 ms 908 KB Output is partially correct
32 Partially correct 90 ms 1112 KB Output is partially correct
33 Partially correct 106 ms 1192 KB Output is partially correct
34 Partially correct 109 ms 944 KB Output is partially correct
35 Partially correct 69 ms 860 KB Output is partially correct
36 Partially correct 70 ms 1104 KB Output is partially correct
37 Partially correct 90 ms 596 KB Output is partially correct
38 Partially correct 86 ms 852 KB Output is partially correct
39 Partially correct 75 ms 1116 KB Output is partially correct
40 Partially correct 68 ms 936 KB Output is partially correct
41 Partially correct 73 ms 916 KB Output is partially correct
42 Partially correct 68 ms 928 KB Output is partially correct
43 Partially correct 21 ms 600 KB Output is partially correct
44 Partially correct 92 ms 936 KB Output is partially correct
45 Partially correct 36 ms 592 KB Output is partially correct
46 Partially correct 59 ms 848 KB Output is partially correct
47 Partially correct 50 ms 696 KB Output is partially correct
48 Partially correct 51 ms 848 KB Output is partially correct