Submission #835471

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
835471	2023-08-23T14:55:03 Z	pavement	Rarest Insects (IOI22_insects)	C++17	93.54 / 100	167 ms	560 KB

insects

#include "insects.h"
#include <bits/stdc++.h>
using namespace std;

#define pb push_back

mt19937 rng(12345);

int N;
vector<int> machine, perm;
vector<bool> in_set;

void my_move_inside(int x) {
	in_set[x] = 1;
}

void my_move_outside(int x) {
	in_set[x] = 0;
}

int my_press_button() {
	vector<int> cur;
	for (int i = 0; i < N; i++) {
		if (in_set[i]) {
			cur.pb(i);
		}
	}
	vector<int> tmp;
	set_symmetric_difference(cur.begin(), cur.end(), machine.begin(), machine.end(), back_inserter(tmp));
	sort(cur.begin(), cur.end());
	for (auto i : tmp) {
		if (binary_search(cur.begin(), cur.end(), i)) {
			move_inside(perm[i]);
		} else {
			move_outside(perm[i]);
		}
	}
	machine = cur;
	return press_button();
}

int min_cardinality(int N) {
	::N = N;
	in_set.resize(N);
	perm.resize(N);
	iota(perm.begin(), perm.end(), 0);
	shuffle(perm.begin(), perm.end(), rng);
	vector<int> v, alr_in;
	my_move_inside(0);
	v.pb(0);
	for (int i = 1; i < N; i++) {
		my_move_inside(i);
		if (my_press_button() != 1) {
			my_move_outside(i);
		} else {
			v.pb(i);
		}
	}
	vector<int> insects;
	insects.resize(N);
	iota(insects.begin(), insects.end(), 0);
	int lo = 1, hi = N / (int)v.size(), ans = -1;
	while (lo <= hi) {
		int mid = (lo + hi) / 2;
		vector<int> to_remove = alr_in;
		for (int i : insects) {
			if ((int)to_remove.size() == (int)v.size() * (mid - 1)) {
				break;
			}
			if (!binary_search(v.begin(), v.end(), i) && !binary_search(alr_in.begin(), alr_in.end(), i)) {
				my_move_inside(i);
				if (my_press_button() > mid) {
					my_move_outside(i);
				} else {
					to_remove.pb(i);
				}
			}
		}
		if ((int)to_remove.size() == (int)v.size() * (mid - 1)) {
			ans = mid;
			lo = mid + 1;
			alr_in = to_remove;
			sort(alr_in.begin(), alr_in.end());
		} else {
			insects = v;
			for (auto i : to_remove) {
				my_move_outside(i);
				insects.pb(i);
			}
			hi = min((int)insects.size() / (int)v.size(), mid - 1);
			alr_in.clear();
		}		
	}
	return ans;
}

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	4 ms	352 KB	Output is correct
7	Correct	3 ms	336 KB	Output is correct
8	Correct	3 ms	336 KB	Output is correct
9	Correct	6 ms	324 KB	Output is correct
10	Correct	4 ms	208 KB	Output is correct
11	Correct	2 ms	208 KB	Output is correct
12	Correct	5 ms	208 KB	Output is correct
13	Correct	3 ms	208 KB	Output is correct
14	Correct	4 ms	336 KB	Output is correct
15	Correct	5 ms	336 KB	Output is correct
16	Correct	5 ms	316 KB	Output is correct
17	Correct	6 ms	336 KB	Output is correct
18	Correct	5 ms	300 KB	Output is correct
19	Correct	5 ms	208 KB	Output is correct
20	Correct	3 ms	208 KB	Output is correct
21	Correct	4 ms	208 KB	Output is correct
22	Correct	3 ms	312 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	4 ms	352 KB	Output is correct
7	Correct	3 ms	336 KB	Output is correct
8	Correct	3 ms	336 KB	Output is correct
9	Correct	6 ms	324 KB	Output is correct
10	Correct	4 ms	208 KB	Output is correct
11	Correct	2 ms	208 KB	Output is correct
12	Correct	5 ms	208 KB	Output is correct
13	Correct	3 ms	208 KB	Output is correct
14	Correct	4 ms	336 KB	Output is correct
15	Correct	5 ms	336 KB	Output is correct
16	Correct	5 ms	316 KB	Output is correct
17	Correct	6 ms	336 KB	Output is correct
18	Correct	5 ms	300 KB	Output is correct
19	Correct	5 ms	208 KB	Output is correct
20	Correct	3 ms	208 KB	Output is correct
21	Correct	4 ms	208 KB	Output is correct
22	Correct	3 ms	312 KB	Output is correct
23	Correct	29 ms	384 KB	Output is correct
24	Correct	12 ms	336 KB	Output is correct
25	Correct	29 ms	304 KB	Output is correct
26	Correct	47 ms	304 KB	Output is correct
27	Correct	20 ms	308 KB	Output is correct
28	Correct	15 ms	360 KB	Output is correct
29	Correct	29 ms	328 KB	Output is correct
30	Correct	28 ms	312 KB	Output is correct
31	Correct	34 ms	376 KB	Output is correct
32	Correct	57 ms	372 KB	Output is correct
33	Correct	41 ms	308 KB	Output is correct
34	Correct	41 ms	368 KB	Output is correct
35	Correct	41 ms	380 KB	Output is correct
36	Correct	34 ms	328 KB	Output is correct
37	Correct	33 ms	380 KB	Output is correct
38	Correct	26 ms	308 KB	Output is correct
39	Correct	31 ms	372 KB	Output is correct
40	Correct	27 ms	336 KB	Output is correct
41	Correct	14 ms	328 KB	Output is correct

Subtask #3
68.54 / 75.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	208 KB	Output is correct
2	Correct	0 ms	216 KB	Output is correct
3	Correct	0 ms	208 KB	Output is correct
4	Correct	0 ms	208 KB	Output is correct
5	Correct	1 ms	208 KB	Output is correct
6	Correct	1 ms	208 KB	Output is correct
7	Correct	56 ms	420 KB	Output is correct
8	Correct	33 ms	392 KB	Output is correct
9	Correct	80 ms	304 KB	Output is correct
10	Partially correct	114 ms	388 KB	Output is partially correct
11	Correct	60 ms	292 KB	Output is correct
12	Correct	50 ms	380 KB	Output is correct
13	Correct	61 ms	292 KB	Output is correct
14	Correct	70 ms	308 KB	Output is correct
15	Partially correct	144 ms	560 KB	Output is partially correct
16	Partially correct	129 ms	552 KB	Output is partially correct
17	Partially correct	129 ms	388 KB	Output is partially correct
18	Partially correct	122 ms	384 KB	Output is partially correct
19	Partially correct	97 ms	424 KB	Output is partially correct
20	Partially correct	140 ms	420 KB	Output is partially correct
21	Partially correct	104 ms	304 KB	Output is partially correct
22	Partially correct	119 ms	376 KB	Output is partially correct
23	Correct	63 ms	376 KB	Output is correct
24	Correct	68 ms	372 KB	Output is correct
25	Correct	52 ms	400 KB	Output is correct
26	Correct	45 ms	340 KB	Output is correct
27	Correct	86 ms	424 KB	Output is correct
28	Correct	79 ms	308 KB	Output is correct
29	Correct	105 ms	428 KB	Output is correct
30	Correct	71 ms	432 KB	Output is correct
31	Partially correct	136 ms	528 KB	Output is partially correct
32	Partially correct	167 ms	308 KB	Output is partially correct
33	Correct	67 ms	324 KB	Output is correct
34	Correct	67 ms	332 KB	Output is correct
35	Correct	85 ms	316 KB	Output is correct
36	Correct	75 ms	312 KB	Output is correct
37	Partially correct	138 ms	408 KB	Output is partially correct
38	Partially correct	133 ms	424 KB	Output is partially correct
39	Correct	86 ms	528 KB	Output is correct
40	Correct	92 ms	324 KB	Output is correct
41	Correct	81 ms	428 KB	Output is correct
42	Correct	64 ms	416 KB	Output is correct
43	Correct	9 ms	312 KB	Output is correct
44	Correct	41 ms	288 KB	Output is correct
45	Correct	66 ms	404 KB	Output is correct
46	Correct	67 ms	376 KB	Output is correct
47	Correct	37 ms	384 KB	Output is correct
48	Correct	51 ms	376 KB	Output is correct

Submission #835471

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 15.0 / 15.0

Subtask #3 68.54 / 75.0

Subtask #1
10.0 / 10.0

Subtask #2
15.0 / 15.0

Subtask #3
68.54 / 75.0