Submission #988524

# Submission time Handle Problem Language Result Execution time Memory
988524 2024-05-25T05:51:51 Z cnn008 Rarest Insects (IOI22_insects) C++17
45.61 / 100
164 ms 1440 KB
#include "bits/stdc++.h"
using namespace std;

#include "insects.h"

#ifdef N_N_C
#include "debug.h"
#else
#define cebug(...) "Arya"
#endif

#define ll long long

const int N=1e5+5;
const int mod=1e9+7;

int vis[2005];
int min_cardinality(int n){
	set <int> s;
	int cad=0;
	auto add = [&](int i) -> void{
		s.insert(i);
		move_inside(i);
	};
	auto del = [&](int i) -> void{
		s.erase(i);
		move_outside(i);
	};
	auto clear = [&]() -> void{
		auto _s=s;
		for(auto i:_s) del(i);
	};
	auto check = [&](int k) -> bool{
		for(int i=0; i<n; i++){
			add(i);
			if(press_button()>k) del(i);
		}
		bool f=((int)s.size()>=cad*k);
		clear();
		return f;
	};
	for(int i=0; i<n; i++){
		add(i);
		if(press_button()==1) cad++;
		else del(i);
	}
	clear();
	if(cad<=12){
		int type=0;
		for(int i=0; i<n; i++){
			if(!vis[i]){
				vis[i]=++type;
				move_inside(i);
				for(int j=i+1; j<n; j++){
					move_inside(j);
					int val=press_button();
					if(val==2) vis[j]=type;
					move_outside(j);
				}
				move_outside(i);
			}
		}
		map <int,int> mp;
		for(int i=0; i<n; i++) mp[vis[i]]++;
		int ans=INT_MAX;
		for(auto [x,y]:mp) ans=min(ans,y);
		return ans;
	}
	int l=2,r=n/cad,ans=1;
	while(l<=r){
		int mid=(l+r)/2;
		if(check(mid)){
			ans=mid;
			l=mid+1;
		}else r=mid-1;
	}
	return ans;
}
/**  /\_/\
*   (= ._.)
*   / >💖 \>💕
**/

Compilation message

insects.cpp:79:9: warning: "/*" within comment [-Wcomment]
   79 | /**  /\_/\
      |
# Verdict Execution time Memory Grader output
1 Correct 1 ms 352 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 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 1 ms 344 KB Output is correct
8 Correct 5 ms 600 KB Output is correct
9 Correct 5 ms 856 KB Output is correct
10 Correct 3 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 4 ms 600 KB Output is correct
14 Correct 5 ms 344 KB Output is correct
15 Correct 9 ms 344 KB Output is correct
16 Correct 9 ms 344 KB Output is correct
17 Correct 10 ms 344 KB Output is correct
18 Correct 5 ms 600 KB Output is correct
19 Correct 4 ms 856 KB Output is correct
20 Correct 3 ms 856 KB Output is correct
21 Correct 2 ms 696 KB Output is correct
22 Correct 2 ms 600 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 352 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 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 1 ms 344 KB Output is correct
8 Correct 5 ms 600 KB Output is correct
9 Correct 5 ms 856 KB Output is correct
10 Correct 3 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 4 ms 600 KB Output is correct
14 Correct 5 ms 344 KB Output is correct
15 Correct 9 ms 344 KB Output is correct
16 Correct 9 ms 344 KB Output is correct
17 Correct 10 ms 344 KB Output is correct
18 Correct 5 ms 600 KB Output is correct
19 Correct 4 ms 856 KB Output is correct
20 Correct 3 ms 856 KB Output is correct
21 Correct 2 ms 696 KB Output is correct
22 Correct 2 ms 600 KB Output is correct
23 Correct 11 ms 428 KB Output is correct
24 Correct 6 ms 1228 KB Output is correct
25 Correct 27 ms 908 KB Output is correct
26 Correct 29 ms 976 KB Output is correct
27 Correct 11 ms 588 KB Output is correct
28 Correct 4 ms 600 KB Output is correct
29 Correct 21 ms 600 KB Output is correct
30 Correct 32 ms 1112 KB Output is correct
31 Correct 30 ms 416 KB Output is correct
32 Correct 47 ms 600 KB Output is correct
33 Correct 65 ms 600 KB Output is correct
34 Correct 69 ms 440 KB Output is correct
35 Correct 36 ms 948 KB Output is correct
36 Correct 36 ms 948 KB Output is correct
37 Correct 24 ms 952 KB Output is correct
38 Correct 19 ms 1112 KB Output is correct
39 Correct 15 ms 956 KB Output is correct
40 Correct 9 ms 856 KB Output is correct
41 Correct 5 ms 856 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 1 ms 344 KB Output is correct
4 Correct 1 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 20 ms 596 KB Output is correct
8 Correct 9 ms 1224 KB Output is correct
9 Partially correct 70 ms 968 KB Output is partially correct
10 Partially correct 56 ms 1360 KB Output is partially correct
11 Correct 24 ms 436 KB Output is correct
12 Correct 20 ms 1376 KB Output is correct
13 Partially correct 57 ms 592 KB Output is partially correct
14 Partially correct 51 ms 1360 KB Output is partially correct
15 Partially correct 50 ms 596 KB Output is partially correct
16 Partially correct 87 ms 592 KB Output is partially correct
17 Partially correct 104 ms 600 KB Output is partially correct
18 Partially correct 164 ms 592 KB Output is partially correct
19 Partially correct 84 ms 1060 KB Output is partially correct
20 Partially correct 75 ms 580 KB Output is partially correct
21 Partially correct 55 ms 1424 KB Output is partially correct
22 Partially correct 59 ms 1260 KB Output is partially correct
23 Partially correct 42 ms 1440 KB Output is partially correct
24 Correct 34 ms 1192 KB Output is correct
25 Correct 20 ms 868 KB Output is correct
26 Correct 11 ms 1120 KB Output is correct
27 Partially correct 58 ms 796 KB Output is partially correct
28 Partially correct 59 ms 1208 KB Output is partially correct
29 Partially correct 84 ms 1060 KB Output is partially correct
30 Partially correct 93 ms 1240 KB Output is partially correct
31 Partially correct 59 ms 752 KB Output is partially correct
32 Partially correct 53 ms 944 KB Output is partially correct
33 Partially correct 47 ms 952 KB Output is partially correct
34 Partially correct 62 ms 1372 KB Output is partially correct
35 Partially correct 61 ms 1372 KB Output is partially correct
36 Partially correct 59 ms 1080 KB Output is partially correct
37 Partially correct 56 ms 1040 KB Output is partially correct
38 Partially correct 52 ms 808 KB Output is partially correct
39 Partially correct 43 ms 1112 KB Output is partially correct
40 Partially correct 45 ms 1000 KB Output is partially correct
41 Partially correct 68 ms 1164 KB Output is partially correct
42 Partially correct 77 ms 1076 KB Output is partially correct
43 Partially correct 15 ms 344 KB Output is partially correct
44 Partially correct 61 ms 432 KB Output is partially correct
45 Correct 29 ms 592 KB Output is correct
46 Correct 20 ms 880 KB Output is correct
47 Correct 20 ms 884 KB Output is correct
48 Correct 19 ms 856 KB Output is correct