Submission #832993

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
832993	2023-08-21T18:34:33 Z	MeGustaElArroz23	Rarest Insects (IOI22_insects)	C++17	45.45 / 100	175 ms	284 KB

insects

#include "insects.h"

using namespace std;

#include<bits/stdc++.h>

#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int,int>
#define vii vector<pii>
#define fi first
#define se second
#define pb push_back
#define vb vector<bool>

int n;
vb box;
vb basic_box;
int basic_box_size;

void create_basic_box(){
	basic_box=vb(n,0);
	for (int i=0;i<n;i++){
		move_inside(i);
		box[i]=1;
		if (press_button()>1){
			move_outside(i);
			box[i]=0;
		}
	}
	basic_box=box;
	basic_box_size=0;
	for (int x:basic_box) basic_box_size+=x;
}

void clear_box(){
	for (int i=0;i<n;i++){
		if (box[i] && (! basic_box[i])){
			box[i]=0;
			move_outside(i);
		}
	}
}

int check_ans(int m){
	for (int i=0;i<n;i++){
		move_inside(i);
		box[i]=1;
		if (press_button()>m){
			move_outside(i);
			box[i]=0;
		}
	}
	int count=0;
	for (int x:box) count+=x;
	if (count==m*basic_box_size){
		basic_box=box;
		return 1;
	}
	else return 0;
}

int min_cardinality(int N) {
	n=N;
	box=vb(n,0);
    create_basic_box();
	clear_box();

	if (basic_box_size==1) return N;

	int l=1;
	int r=n/basic_box_size+1;

	while (l!=r-1){
		//cerr << l << ' ' << r << '\n';
		int m;
		if (r-l>30) m=max((int) (0.38*l+0.62*r),l+1);
		else m=(l+r)/2;
		if (check_ans(m)) l=m;
		else r=m;
		clear_box();
	}

	return l;
}

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	208 KB	Output is correct
2	Correct	0 ms	208 KB	Output is correct
3	Correct	0 ms	208 KB	Output is correct
4	Correct	0 ms	208 KB	Output is correct
5	Correct	0 ms	208 KB	Output is correct
6	Correct	1 ms	208 KB	Output is correct
7	Correct	2 ms	208 KB	Output is correct
8	Correct	8 ms	208 KB	Output is correct
9	Correct	6 ms	208 KB	Output is correct
10	Correct	13 ms	208 KB	Output is correct
11	Correct	2 ms	208 KB	Output is correct
12	Correct	9 ms	208 KB	Output is correct
13	Correct	8 ms	208 KB	Output is correct
14	Correct	9 ms	208 KB	Output is correct
15	Correct	8 ms	208 KB	Output is correct
16	Correct	6 ms	208 KB	Output is correct
17	Correct	6 ms	208 KB	Output is correct
18	Correct	7 ms	208 KB	Output is correct
19	Correct	4 ms	208 KB	Output is correct
20	Correct	4 ms	208 KB	Output is correct
21	Correct	3 ms	208 KB	Output is correct
22	Correct	2 ms	208 KB	Output is correct

Subtask #2
15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	208 KB	Output is correct
2	Correct	0 ms	208 KB	Output is correct
3	Correct	0 ms	208 KB	Output is correct
4	Correct	0 ms	208 KB	Output is correct
5	Correct	0 ms	208 KB	Output is correct
6	Correct	1 ms	208 KB	Output is correct
7	Correct	2 ms	208 KB	Output is correct
8	Correct	8 ms	208 KB	Output is correct
9	Correct	6 ms	208 KB	Output is correct
10	Correct	13 ms	208 KB	Output is correct
11	Correct	2 ms	208 KB	Output is correct
12	Correct	9 ms	208 KB	Output is correct
13	Correct	8 ms	208 KB	Output is correct
14	Correct	9 ms	208 KB	Output is correct
15	Correct	8 ms	208 KB	Output is correct
16	Correct	6 ms	208 KB	Output is correct
17	Correct	6 ms	208 KB	Output is correct
18	Correct	7 ms	208 KB	Output is correct
19	Correct	4 ms	208 KB	Output is correct
20	Correct	4 ms	208 KB	Output is correct
21	Correct	3 ms	208 KB	Output is correct
22	Correct	2 ms	208 KB	Output is correct
23	Correct	7 ms	208 KB	Output is correct
24	Correct	7 ms	208 KB	Output is correct
25	Correct	36 ms	208 KB	Output is correct
26	Correct	30 ms	208 KB	Output is correct
27	Correct	70 ms	208 KB	Output is correct
28	Correct	8 ms	208 KB	Output is correct
29	Correct	53 ms	208 KB	Output is correct
30	Correct	34 ms	276 KB	Output is correct
31	Correct	52 ms	208 KB	Output is correct
32	Correct	51 ms	208 KB	Output is correct
33	Correct	25 ms	208 KB	Output is correct
34	Correct	44 ms	208 KB	Output is correct
35	Correct	33 ms	208 KB	Output is correct
36	Correct	40 ms	208 KB	Output is correct
37	Correct	32 ms	208 KB	Output is correct
38	Correct	25 ms	208 KB	Output is correct
39	Correct	18 ms	208 KB	Output is correct
40	Correct	15 ms	208 KB	Output is correct
41	Correct	7 ms	208 KB	Output is correct

Subtask #3
20.45 / 75.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	208 KB	Output is correct
2	Correct	0 ms	208 KB	Output is correct
3	Correct	0 ms	208 KB	Output is correct
4	Correct	1 ms	208 KB	Output is correct
5	Correct	0 ms	208 KB	Output is correct
6	Partially correct	1 ms	208 KB	Output is partially correct
7	Correct	13 ms	208 KB	Output is correct
8	Correct	14 ms	208 KB	Output is correct
9	Partially correct	80 ms	208 KB	Output is partially correct
10	Partially correct	52 ms	208 KB	Output is partially correct
11	Partially correct	171 ms	208 KB	Output is partially correct
12	Correct	21 ms	208 KB	Output is correct
13	Partially correct	136 ms	208 KB	Output is partially correct
14	Partially correct	89 ms	208 KB	Output is partially correct
15	Partially correct	103 ms	208 KB	Output is partially correct
16	Partially correct	94 ms	208 KB	Output is partially correct
17	Partially correct	93 ms	208 KB	Output is partially correct
18	Partially correct	105 ms	280 KB	Output is partially correct
19	Partially correct	98 ms	208 KB	Output is partially correct
20	Partially correct	97 ms	284 KB	Output is partially correct
21	Partially correct	64 ms	208 KB	Output is partially correct
22	Partially correct	78 ms	208 KB	Output is partially correct
23	Partially correct	53 ms	208 KB	Output is partially correct
24	Correct	22 ms	280 KB	Output is correct
25	Correct	25 ms	208 KB	Output is correct
26	Correct	15 ms	208 KB	Output is correct
27	Partially correct	78 ms	208 KB	Output is partially correct
28	Partially correct	83 ms	208 KB	Output is partially correct
29	Partially correct	77 ms	208 KB	Output is partially correct
30	Partially correct	88 ms	208 KB	Output is partially correct
31	Partially correct	81 ms	208 KB	Output is partially correct
32	Partially correct	58 ms	276 KB	Output is partially correct
33	Partially correct	69 ms	208 KB	Output is partially correct
34	Partially correct	67 ms	208 KB	Output is partially correct
35	Partially correct	57 ms	208 KB	Output is partially correct
36	Partially correct	68 ms	208 KB	Output is partially correct
37	Partially correct	66 ms	276 KB	Output is partially correct
38	Partially correct	94 ms	280 KB	Output is partially correct
39	Partially correct	70 ms	208 KB	Output is partially correct
40	Partially correct	43 ms	236 KB	Output is partially correct
41	Partially correct	78 ms	208 KB	Output is partially correct
42	Partially correct	111 ms	208 KB	Output is partially correct
43	Partially correct	39 ms	208 KB	Output is partially correct
44	Partially correct	126 ms	208 KB	Output is partially correct
45	Partially correct	175 ms	208 KB	Output is partially correct
46	Correct	29 ms	208 KB	Output is correct
47	Correct	35 ms	208 KB	Output is correct
48	Correct	26 ms	208 KB	Output is correct

Submission #832993

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 15.0 / 15.0

Subtask #3 20.45 / 75.0

Subtask #1
10.0 / 10.0

Subtask #2
15.0 / 15.0

Subtask #3
20.45 / 75.0