Submission #1079554

# Submission time Handle Problem Language Result Execution time Memory
1079554 2024-08-28T16:48:53 Z Lalic Rarest Insects (IOI22_insects) C++17
57.14 / 100
113 ms 692 KB
#include "insects.h"
#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define pb push_back
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define mp make_pair

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef complex<double> cd;

int min_cardinality(int N) {
	queue<int> q;
	vector<int> aux;
	
	int tipos=0;
	for(int i=0;i<N;i++){
		move_inside(i);
		int curr=press_button();
		
		if(curr>=2) move_outside(i);
		else{
			tipos++;
			q.push(i);
			aux.pb(i);
		}
	}
	
	if(tipos==1) return N;
	
	while(!q.empty()){
		move_outside(q.front());
		q.pop();
	}
	
	if(tipos<=(8*N)/2000){
		int ans=N;
		
		for(auto u : aux){
			int ret=1;
			move_inside(u);
			
			for(int i=0;i<N;i++){
				if(i==u) continue;
				
				move_inside(i);
				int at=press_button();
				
				if(at==2) ret++;
				
				move_outside(i);
			}
			
			move_outside(u);
			
			ans=min(ans, ret);
		}
		
		return ans;
	}
	
	int low=1, high=(N/tipos), best=N/tipos+1;
	while(low<=high){
		int mid=(low+high)>>1;
		
		while(!q.empty()){
			move_outside(q.front());
			q.pop();
		}
		
		int qnt=0;
		for(int i=0;i<N;i++){
			move_inside(i);
			int curr=press_button();
			
			if(curr>mid) move_outside(i);
			else{
				qnt++;
				q.push(i);
			}
		}
		
		if(qnt/mid==tipos){
			best=mid;
			low=mid+1;
		}
		else high=mid-1;
	}
	
	return best;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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 1 ms 344 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 4 ms 344 KB Output is correct
9 Correct 4 ms 344 KB Output is correct
10 Correct 8 ms 344 KB Output is correct
11 Correct 2 ms 344 KB Output is correct
12 Correct 6 ms 344 KB Output is correct
13 Correct 5 ms 344 KB Output is correct
14 Correct 7 ms 344 KB Output is correct
15 Correct 6 ms 344 KB Output is correct
16 Correct 5 ms 344 KB Output is correct
17 Correct 6 ms 344 KB Output is correct
18 Correct 6 ms 344 KB Output is correct
19 Correct 4 ms 344 KB Output is correct
20 Correct 3 ms 344 KB Output is correct
21 Correct 2 ms 344 KB Output is correct
22 Correct 2 ms 344 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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 1 ms 344 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 4 ms 344 KB Output is correct
9 Correct 4 ms 344 KB Output is correct
10 Correct 8 ms 344 KB Output is correct
11 Correct 2 ms 344 KB Output is correct
12 Correct 6 ms 344 KB Output is correct
13 Correct 5 ms 344 KB Output is correct
14 Correct 7 ms 344 KB Output is correct
15 Correct 6 ms 344 KB Output is correct
16 Correct 5 ms 344 KB Output is correct
17 Correct 6 ms 344 KB Output is correct
18 Correct 6 ms 344 KB Output is correct
19 Correct 4 ms 344 KB Output is correct
20 Correct 3 ms 344 KB Output is correct
21 Correct 2 ms 344 KB Output is correct
22 Correct 2 ms 344 KB Output is correct
23 Correct 7 ms 344 KB Output is correct
24 Correct 13 ms 344 KB Output is correct
25 Correct 30 ms 344 KB Output is correct
26 Correct 30 ms 416 KB Output is correct
27 Correct 15 ms 340 KB Output is correct
28 Correct 7 ms 344 KB Output is correct
29 Correct 71 ms 344 KB Output is correct
30 Correct 29 ms 344 KB Output is correct
31 Correct 47 ms 416 KB Output is correct
32 Correct 50 ms 344 KB Output is correct
33 Correct 44 ms 600 KB Output is correct
34 Correct 56 ms 440 KB Output is correct
35 Correct 42 ms 596 KB Output is correct
36 Correct 46 ms 596 KB Output is correct
37 Correct 24 ms 344 KB Output is correct
38 Correct 38 ms 600 KB Output is correct
39 Correct 26 ms 592 KB Output is correct
40 Correct 19 ms 428 KB Output is correct
41 Correct 7 ms 340 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 Partially correct 1 ms 344 KB Output is partially correct
7 Correct 9 ms 344 KB Output is correct
8 Correct 21 ms 456 KB Output is correct
9 Partially correct 98 ms 672 KB Output is partially correct
10 Partially correct 87 ms 668 KB Output is partially correct
11 Correct 35 ms 344 KB Output is correct
12 Correct 38 ms 436 KB Output is correct
13 Partially correct 79 ms 344 KB Output is partially correct
14 Partially correct 80 ms 592 KB Output is partially correct
15 Partially correct 91 ms 344 KB Output is partially correct
16 Partially correct 113 ms 420 KB Output is partially correct
17 Partially correct 98 ms 652 KB Output is partially correct
18 Partially correct 101 ms 648 KB Output is partially correct
19 Partially correct 91 ms 668 KB Output is partially correct
20 Partially correct 112 ms 672 KB Output is partially correct
21 Partially correct 71 ms 668 KB Output is partially correct
22 Partially correct 77 ms 664 KB Output is partially correct
23 Partially correct 64 ms 416 KB Output is partially correct
24 Correct 35 ms 416 KB Output is correct
25 Correct 32 ms 344 KB Output is correct
26 Correct 26 ms 452 KB Output is correct
27 Partially correct 85 ms 672 KB Output is partially correct
28 Partially correct 57 ms 676 KB Output is partially correct
29 Partially correct 89 ms 420 KB Output is partially correct
30 Partially correct 95 ms 416 KB Output is partially correct
31 Partially correct 65 ms 416 KB Output is partially correct
32 Partially correct 68 ms 420 KB Output is partially correct
33 Partially correct 68 ms 408 KB Output is partially correct
34 Partially correct 41 ms 420 KB Output is partially correct
35 Partially correct 87 ms 420 KB Output is partially correct
36 Partially correct 103 ms 420 KB Output is partially correct
37 Partially correct 68 ms 420 KB Output is partially correct
38 Partially correct 69 ms 672 KB Output is partially correct
39 Partially correct 66 ms 432 KB Output is partially correct
40 Partially correct 53 ms 436 KB Output is partially correct
41 Partially correct 100 ms 660 KB Output is partially correct
42 Partially correct 72 ms 672 KB Output is partially correct
43 Partially correct 24 ms 344 KB Output is partially correct
44 Partially correct 66 ms 344 KB Output is partially correct
45 Correct 31 ms 344 KB Output is correct
46 Correct 29 ms 692 KB Output is correct
47 Correct 38 ms 344 KB Output is correct
48 Correct 43 ms 676 KB Output is correct