oj.uz

Submission #871220

# Submission time Handle Problem Language Result Execution time Memory
871220 2023-11-10T09:14:54 Z Lib Rarest Insects (IOI22_insects) C++17
53.16 / 100
 99 ms 704 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;
int CurrentInMachine;
int l,r,mid;
 
int PossibleMincount(int cnt){
	while(!PrevIndex.empty()){
			PrevIndex.pop_back();
		}
	//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]]==0){
			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;
			}
		}
	}
	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.back()]=0;
			move_outside(PrevIndex.back());
			PrevIndex.pop_back();
		}	
		CurrentInMachine=0;
		for(int i=0;i<n;i++){
			CurrentInMachine+=InMachine[Permutation[i]];
		}
		PrevIndex.clear();
		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;
    }
    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;
	l=1;
	//Phase 2: Binary search for the answer
	while(r-l>=1){
		CurrentInMachine=0;
		for(int i=0;i<n;i++){
			CurrentInMachine+=InMachine[Permutation[i]];
		}
		r=min(r,l+(N-CurrentInMachine)/TypeCount+1);
		mid=(l+r+1)/2;
		if(PossibleMincount(mid)){
			l=mid;
			//r=min(r,mid+(N-CurrentInMachine)/TypeCount);
		}else{
			r=mid-1;
		}
	}
	if(ok[r]){
		return r;
	}else{
		return l;
	}
}

Compilation message

insects.cpp: In function 'int PossibleMincount(int)':
insects.cpp:31:23: warning: comparison of integer expressions of different signedness: 'std::deque<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   31 |    if(PrevIndex.size()==(cnt-l)*TypeCount){
      |       ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 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 3 ms 344 KB Output is correct
10 Correct 6 ms 344 KB Output is correct
11 Correct 2 ms 344 KB Output is correct
12 Correct 4 ms 344 KB Output is correct
13 Correct 3 ms 344 KB Output is correct
14 Correct 2 ms 344 KB Output is correct
15 Correct 3 ms 344 KB Output is correct
16 Correct 3 ms 344 KB Output is correct
17 Correct 3 ms 344 KB Output is correct
18 Correct 4 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

Subtask #2
15.0 / 15.0

# 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 3 ms 344 KB Output is correct
10 Correct 6 ms 344 KB Output is correct
11 Correct 2 ms 344 KB Output is correct
12 Correct 4 ms 344 KB Output is correct
13 Correct 3 ms 344 KB Output is correct
14 Correct 2 ms 344 KB Output is correct
15 Correct 3 ms 344 KB Output is correct
16 Correct 3 ms 344 KB Output is correct
17 Correct 3 ms 344 KB Output is correct
18 Correct 4 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 8 ms 344 KB Output is correct
24 Correct 4 ms 456 KB Output is correct
25 Correct 12 ms 600 KB Output is correct
26 Correct 17 ms 592 KB Output is correct
27 Correct 42 ms 344 KB Output is correct
28 Correct 6 ms 344 KB Output is correct
29 Correct 43 ms 600 KB Output is correct
30 Correct 28 ms 452 KB Output is correct
31 Correct 10 ms 600 KB Output is correct
32 Correct 13 ms 344 KB Output is correct
33 Correct 14 ms 600 KB Output is correct
34 Correct 14 ms 452 KB Output is correct
35 Correct 10 ms 600 KB Output is correct
36 Correct 14 ms 600 KB Output is correct
37 Correct 12 ms 600 KB Output is correct
38 Correct 16 ms 456 KB Output is correct
39 Correct 12 ms 600 KB Output is correct
40 Correct 8 ms 600 KB Output is correct
41 Correct 7 ms 460 KB Output is correct

Subtask #3
28.16 / 75.0

# 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 1 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 8 ms 600 KB Output is correct
9 Correct 21 ms 448 KB Output is correct
10 Partially correct 44 ms 704 KB Output is partially correct
11 Partially correct 96 ms 592 KB Output is partially correct
12 Correct 14 ms 600 KB Output is correct
13 Partially correct 99 ms 452 KB Output is partially correct
14 Partially correct 54 ms 456 KB Output is partially correct
15 Correct 23 ms 432 KB Output is correct
16 Correct 20 ms 344 KB Output is correct
17 Correct 24 ms 448 KB Output is correct
18 Partially correct 32 ms 460 KB Output is partially correct
19 Correct 26 ms 432 KB Output is correct
20 Partially correct 26 ms 592 KB Output is partially correct
21 Partially correct 33 ms 592 KB Output is partially correct
22 Partially correct 45 ms 592 KB Output is partially correct
23 Partially correct 36 ms 592 KB Output is partially correct
24 Correct 20 ms 600 KB Output is correct
25 Correct 13 ms 600 KB Output is correct
26 Correct 11 ms 436 KB Output is correct
27 Correct 24 ms 592 KB Output is correct
28 Correct 21 ms 592 KB Output is correct
29 Correct 27 ms 448 KB Output is correct
30 Correct 31 ms 592 KB Output is correct
31 Partially correct 44 ms 436 KB Output is partially correct
32 Partially correct 39 ms 596 KB Output is partially correct
33 Partially correct 46 ms 432 KB Output is partially correct
34 Partially correct 40 ms 444 KB Output is partially correct
35 Correct 22 ms 448 KB Output is correct
36 Correct 23 ms 444 KB Output is correct
37 Partially correct 34 ms 596 KB Output is partially correct
38 Partially correct 38 ms 600 KB Output is partially correct
39 Correct 22 ms 432 KB Output is correct
40 Correct 29 ms 600 KB Output is correct
41 Correct 21 ms 432 KB Output is correct
42 Correct 24 ms 444 KB Output is correct
43 Partially correct 15 ms 344 KB Output is partially correct
44 Partially correct 84 ms 344 KB Output is partially correct
45 Correct 19 ms 448 KB Output is correct
46 Correct 14 ms 600 KB Output is correct
47 Correct 13 ms 600 KB Output is correct
48 Correct 13 ms 452 KB Output is correct