Submission #1079553

# Submission time Handle Problem Language Result Execution time Memory
1079553 2024-08-28T16:47:41 Z Lalic Rarest Insects (IOI22_insects) C++17
47.5 / 100
178 ms 920 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-1, best=N;
	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 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 1 ms 344 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 10 ms 344 KB Output is correct
8 Correct 9 ms 344 KB Output is correct
9 Correct 10 ms 344 KB Output is correct
10 Correct 9 ms 344 KB Output is correct
11 Correct 10 ms 344 KB Output is correct
12 Correct 5 ms 344 KB Output is correct
13 Correct 11 ms 344 KB Output is correct
14 Correct 9 ms 344 KB Output is correct
15 Correct 9 ms 344 KB Output is correct
16 Correct 8 ms 344 KB Output is correct
17 Correct 9 ms 344 KB Output is correct
18 Correct 8 ms 344 KB Output is correct
19 Correct 11 ms 596 KB Output is correct
20 Correct 11 ms 436 KB Output is correct
21 Correct 9 ms 344 KB Output is correct
22 Correct 13 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 1 ms 344 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 10 ms 344 KB Output is correct
8 Correct 9 ms 344 KB Output is correct
9 Correct 10 ms 344 KB Output is correct
10 Correct 9 ms 344 KB Output is correct
11 Correct 10 ms 344 KB Output is correct
12 Correct 5 ms 344 KB Output is correct
13 Correct 11 ms 344 KB Output is correct
14 Correct 9 ms 344 KB Output is correct
15 Correct 9 ms 344 KB Output is correct
16 Correct 8 ms 344 KB Output is correct
17 Correct 9 ms 344 KB Output is correct
18 Correct 8 ms 344 KB Output is correct
19 Correct 11 ms 596 KB Output is correct
20 Correct 11 ms 436 KB Output is correct
21 Correct 9 ms 344 KB Output is correct
22 Correct 13 ms 344 KB Output is correct
23 Correct 8 ms 344 KB Output is correct
24 Correct 84 ms 600 KB Output is correct
25 Correct 69 ms 592 KB Output is correct
26 Correct 71 ms 344 KB Output is correct
27 Correct 24 ms 344 KB Output is correct
28 Correct 63 ms 432 KB Output is correct
29 Correct 66 ms 344 KB Output is correct
30 Correct 71 ms 600 KB Output is correct
31 Correct 61 ms 344 KB Output is correct
32 Correct 62 ms 440 KB Output is correct
33 Correct 65 ms 600 KB Output is correct
34 Correct 68 ms 432 KB Output is correct
35 Correct 67 ms 344 KB Output is correct
36 Correct 85 ms 344 KB Output is correct
37 Correct 58 ms 436 KB Output is correct
38 Correct 64 ms 344 KB Output is correct
39 Correct 81 ms 600 KB Output is correct
40 Correct 55 ms 344 KB Output is correct
41 Correct 62 ms 424 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 Partially correct 1 ms 344 KB Output is partially correct
6 Partially correct 1 ms 344 KB Output is partially correct
7 Correct 10 ms 344 KB Output is correct
8 Partially correct 150 ms 812 KB Output is partially correct
9 Partially correct 153 ms 908 KB Output is partially correct
10 Partially correct 151 ms 616 KB Output is partially correct
11 Correct 37 ms 344 KB Output is correct
12 Partially correct 142 ms 648 KB Output is partially correct
13 Partially correct 75 ms 344 KB Output is partially correct
14 Partially correct 136 ms 592 KB Output is partially correct
15 Partially correct 73 ms 340 KB Output is partially correct
16 Partially correct 146 ms 664 KB Output is partially correct
17 Partially correct 154 ms 536 KB Output is partially correct
18 Partially correct 153 ms 904 KB Output is partially correct
19 Partially correct 157 ms 664 KB Output is partially correct
20 Partially correct 138 ms 916 KB Output is partially correct
21 Partially correct 173 ms 648 KB Output is partially correct
22 Partially correct 148 ms 428 KB Output is partially correct
23 Partially correct 156 ms 428 KB Output is partially correct
24 Partially correct 146 ms 680 KB Output is partially correct
25 Partially correct 178 ms 776 KB Output is partially correct
26 Partially correct 149 ms 672 KB Output is partially correct
27 Partially correct 121 ms 424 KB Output is partially correct
28 Partially correct 147 ms 664 KB Output is partially correct
29 Partially correct 133 ms 664 KB Output is partially correct
30 Partially correct 152 ms 664 KB Output is partially correct
31 Partially correct 164 ms 920 KB Output is partially correct
32 Partially correct 175 ms 672 KB Output is partially correct
33 Partially correct 166 ms 676 KB Output is partially correct
34 Partially correct 137 ms 668 KB Output is partially correct
35 Partially correct 140 ms 664 KB Output is partially correct
36 Partially correct 145 ms 668 KB Output is partially correct
37 Partially correct 164 ms 520 KB Output is partially correct
38 Partially correct 149 ms 664 KB Output is partially correct
39 Partially correct 149 ms 672 KB Output is partially correct
40 Partially correct 156 ms 668 KB Output is partially correct
41 Partially correct 138 ms 488 KB Output is partially correct
42 Partially correct 133 ms 580 KB Output is partially correct
43 Partially correct 27 ms 344 KB Output is partially correct
44 Partially correct 107 ms 344 KB Output is partially correct
45 Correct 29 ms 344 KB Output is correct
46 Partially correct 163 ms 920 KB Output is partially correct
47 Partially correct 162 ms 428 KB Output is partially correct
48 Partially correct 145 ms 684 KB Output is partially correct