Submission #988533

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
988533	2024-05-25T06:09:50 Z	cnn008	Rarest Insects (IOI22_insects)	C++17	57.25 / 100	107 ms	1484 KB

insects

#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 min_cardinality(int n){
	set <int> s;
	vector <int> nw;
	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{
		nw.clear();
		for(int i=0; i<n; i++){
			if(s.find(i)!=s.end()) continue;
			add(i);
			if(press_button()>k) del(i);
			else nw.push_back(i);
		}
		return (int)s.size()>=cad*k;
	};
	for(int i=0; i<n; i++){
		add(i);
		if(press_button()==1) cad++;
		else del(i);
	}
	clear();
	if(cad<=9){
		vector <int> vis(n,0);
		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;
			for(auto i:nw) del(i);
		}
	}
	return ans;
}
/**  /\_/\
*   (= ._.)
*   / >💖 \>💕
**/

Compilation message

insects.cpp:84:9: warning: "/*" within comment [-Wcomment]
   84 | /**  /\_/\
      |

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	1 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	2 ms	344 KB	Output is correct
7	Correct	2 ms	600 KB	Output is correct
8	Correct	3 ms	696 KB	Output is correct
9	Correct	5 ms	692 KB	Output is correct
10	Correct	3 ms	344 KB	Output is correct
11	Correct	2 ms	344 KB	Output is correct
12	Correct	5 ms	596 KB	Output is correct
13	Correct	4 ms	600 KB	Output is correct
14	Correct	5 ms	344 KB	Output is correct
15	Correct	7 ms	344 KB	Output is correct
16	Correct	3 ms	600 KB	Output is correct
17	Correct	3 ms	856 KB	Output is correct
18	Correct	5 ms	600 KB	Output is correct
19	Correct	3 ms	600 KB	Output is correct
20	Correct	3 ms	692 KB	Output is correct
21	Correct	3 ms	596 KB	Output is correct
22	Correct	2 ms	600 KB	Output is correct

Subtask #2
15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	1 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	2 ms	344 KB	Output is correct
7	Correct	2 ms	600 KB	Output is correct
8	Correct	3 ms	696 KB	Output is correct
9	Correct	5 ms	692 KB	Output is correct
10	Correct	3 ms	344 KB	Output is correct
11	Correct	2 ms	344 KB	Output is correct
12	Correct	5 ms	596 KB	Output is correct
13	Correct	4 ms	600 KB	Output is correct
14	Correct	5 ms	344 KB	Output is correct
15	Correct	7 ms	344 KB	Output is correct
16	Correct	3 ms	600 KB	Output is correct
17	Correct	3 ms	856 KB	Output is correct
18	Correct	5 ms	600 KB	Output is correct
19	Correct	3 ms	600 KB	Output is correct
20	Correct	3 ms	692 KB	Output is correct
21	Correct	3 ms	596 KB	Output is correct
22	Correct	2 ms	600 KB	Output is correct
23	Correct	9 ms	600 KB	Output is correct
24	Correct	5 ms	980 KB	Output is correct
25	Correct	12 ms	716 KB	Output is correct
26	Correct	17 ms	880 KB	Output is correct
27	Correct	14 ms	428 KB	Output is correct
28	Correct	6 ms	856 KB	Output is correct
29	Correct	23 ms	600 KB	Output is correct
30	Correct	26 ms	600 KB	Output is correct
31	Correct	27 ms	428 KB	Output is correct
32	Correct	38 ms	432 KB	Output is correct
33	Correct	16 ms	600 KB	Output is correct
34	Correct	16 ms	704 KB	Output is correct
35	Correct	15 ms	856 KB	Output is correct
36	Correct	18 ms	852 KB	Output is correct
37	Correct	19 ms	1108 KB	Output is correct
38	Correct	18 ms	860 KB	Output is correct
39	Correct	13 ms	1112 KB	Output is correct
40	Correct	10 ms	860 KB	Output is correct
41	Correct	5 ms	1144 KB	Output is correct

Subtask #3
32.25 / 75.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	1 ms	344 KB	Output is correct
3	Correct	1 ms	352 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	17 ms	408 KB	Output is correct
8	Correct	10 ms	1120 KB	Output is correct
9	Correct	25 ms	1448 KB	Output is correct
10	Partially correct	41 ms	1200 KB	Output is partially correct
11	Correct	30 ms	412 KB	Output is correct
12	Correct	17 ms	1124 KB	Output is correct
13	Partially correct	43 ms	600 KB	Output is partially correct
14	Partially correct	55 ms	876 KB	Output is partially correct
15	Partially correct	57 ms	600 KB	Output is partially correct
16	Partially correct	107 ms	600 KB	Output is partially correct
17	Partially correct	33 ms	996 KB	Output is partially correct
18	Partially correct	37 ms	692 KB	Output is partially correct
19	Partially correct	35 ms	972 KB	Output is partially correct
20	Partially correct	42 ms	1108 KB	Output is partially correct
21	Partially correct	38 ms	1228 KB	Output is partially correct
22	Partially correct	55 ms	948 KB	Output is partially correct
23	Partially correct	37 ms	720 KB	Output is partially correct
24	Correct	28 ms	860 KB	Output is correct
25	Correct	17 ms	1212 KB	Output is correct
26	Correct	10 ms	1112 KB	Output is correct
27	Correct	28 ms	1484 KB	Output is correct
28	Correct	25 ms	1220 KB	Output is correct
29	Partially correct	26 ms	1216 KB	Output is partially correct
30	Partially correct	28 ms	1020 KB	Output is partially correct
31	Partially correct	33 ms	928 KB	Output is partially correct
32	Partially correct	41 ms	1204 KB	Output is partially correct
33	Partially correct	45 ms	932 KB	Output is partially correct
34	Partially correct	55 ms	592 KB	Output is partially correct
35	Partially correct	27 ms	908 KB	Output is partially correct
36	Partially correct	29 ms	716 KB	Output is partially correct
37	Partially correct	39 ms	944 KB	Output is partially correct
38	Partially correct	39 ms	1408 KB	Output is partially correct
39	Correct	30 ms	980 KB	Output is correct
40	Correct	23 ms	944 KB	Output is correct
41	Partially correct	35 ms	1440 KB	Output is partially correct
42	Partially correct	27 ms	1372 KB	Output is partially correct
43	Partially correct	13 ms	600 KB	Output is partially correct
44	Partially correct	50 ms	600 KB	Output is partially correct
45	Correct	28 ms	600 KB	Output is correct
46	Correct	17 ms	856 KB	Output is correct
47	Correct	17 ms	872 KB	Output is correct
48	Correct	20 ms	1148 KB	Output is correct

Submission #988533

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 15.0 / 15.0

Subtask #3 32.25 / 75.0

Subtask #1
10.0 / 10.0

Subtask #2
15.0 / 15.0

Subtask #3
32.25 / 75.0