Submission #835458

# Submission time Handle Problem Language Result Execution time Memory
835458 2023-08-23T14:44:52 Z pavement Rarest Insects (IOI22_insects) C++17
90.29 / 100
81 ms 408 KB
#include "insects.h"
#include <bits/stdc++.h>
using namespace std;

#define pb push_back

int N;
vector<int> machine;
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(i);
		} else {
			move_outside(i);
		}
	}
	machine = cur;
	return press_button();
}

int min_cardinality(int N) {
	::N = N;
	in_set.resize(N);
	vector<int> v, alr_in;
	move_inside(0);
	v.pb(0);
	for (int i = 1; i < N; i++) {
		move_inside(i);
		if (press_button() != 1) {
			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 (!binary_search(v.begin(), v.end(), i) && !binary_search(alr_in.begin(), alr_in.end(), i)) {
				move_inside(i);
				if (press_button() > mid) {
					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;
			hi = mid - 1;
			for (auto i : to_remove) {
				move_outside(i);
				insects.pb(i);
			}
			alr_in.clear();
		}		
	}
	return ans;
}
# 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 6 ms 208 KB Output is correct
7 Correct 2 ms 296 KB Output is correct
8 Correct 6 ms 208 KB Output is correct
9 Correct 5 ms 208 KB Output is correct
10 Correct 5 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 4 ms 208 KB Output is correct
14 Correct 5 ms 208 KB Output is correct
15 Correct 7 ms 296 KB Output is correct
16 Correct 5 ms 208 KB Output is correct
17 Correct 4 ms 208 KB Output is correct
18 Correct 4 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 4 ms 208 KB Output is correct
22 Correct 2 ms 208 KB Output is correct
# 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 6 ms 208 KB Output is correct
7 Correct 2 ms 296 KB Output is correct
8 Correct 6 ms 208 KB Output is correct
9 Correct 5 ms 208 KB Output is correct
10 Correct 5 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 4 ms 208 KB Output is correct
14 Correct 5 ms 208 KB Output is correct
15 Correct 7 ms 296 KB Output is correct
16 Correct 5 ms 208 KB Output is correct
17 Correct 4 ms 208 KB Output is correct
18 Correct 4 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 4 ms 208 KB Output is correct
22 Correct 2 ms 208 KB Output is correct
23 Correct 18 ms 300 KB Output is correct
24 Correct 9 ms 208 KB Output is correct
25 Correct 26 ms 304 KB Output is correct
26 Correct 30 ms 296 KB Output is correct
27 Correct 19 ms 304 KB Output is correct
28 Correct 12 ms 304 KB Output is correct
29 Correct 20 ms 276 KB Output is correct
30 Correct 17 ms 208 KB Output is correct
31 Correct 26 ms 332 KB Output is correct
32 Correct 36 ms 208 KB Output is correct
33 Correct 33 ms 292 KB Output is correct
34 Correct 34 ms 296 KB Output is correct
35 Correct 27 ms 276 KB Output is correct
36 Correct 13 ms 300 KB Output is correct
37 Correct 28 ms 288 KB Output is correct
38 Correct 19 ms 288 KB Output is correct
39 Correct 17 ms 300 KB Output is correct
40 Correct 16 ms 288 KB Output is correct
41 Correct 13 ms 304 KB Output is correct
# 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 48 ms 292 KB Output is correct
8 Correct 14 ms 308 KB Output is correct
9 Correct 46 ms 300 KB Output is correct
10 Partially correct 50 ms 320 KB Output is partially correct
11 Correct 31 ms 208 KB Output is correct
12 Correct 24 ms 300 KB Output is correct
13 Correct 36 ms 208 KB Output is correct
14 Correct 32 ms 284 KB Output is correct
15 Partially correct 65 ms 328 KB Output is partially correct
16 Partially correct 81 ms 312 KB Output is partially correct
17 Partially correct 54 ms 328 KB Output is partially correct
18 Partially correct 50 ms 292 KB Output is partially correct
19 Partially correct 30 ms 312 KB Output is partially correct
20 Partially correct 59 ms 300 KB Output is partially correct
21 Partially correct 56 ms 408 KB Output is partially correct
22 Partially correct 59 ms 284 KB Output is partially correct
23 Correct 45 ms 284 KB Output is correct
24 Correct 26 ms 208 KB Output is correct
25 Correct 31 ms 300 KB Output is correct
26 Correct 24 ms 208 KB Output is correct
27 Partially correct 48 ms 280 KB Output is partially correct
28 Partially correct 43 ms 320 KB Output is partially correct
29 Partially correct 43 ms 276 KB Output is partially correct
30 Partially correct 51 ms 304 KB Output is partially correct
31 Partially correct 48 ms 292 KB Output is partially correct
32 Partially correct 77 ms 308 KB Output is partially correct
33 Correct 33 ms 208 KB Output is correct
34 Correct 48 ms 292 KB Output is correct
35 Partially correct 44 ms 280 KB Output is partially correct
36 Partially correct 54 ms 296 KB Output is partially correct
37 Partially correct 39 ms 408 KB Output is partially correct
38 Partially correct 64 ms 284 KB Output is partially correct
39 Partially correct 41 ms 292 KB Output is partially correct
40 Partially correct 55 ms 292 KB Output is partially correct
41 Partially correct 38 ms 312 KB Output is partially correct
42 Partially correct 23 ms 304 KB Output is partially correct
43 Correct 16 ms 208 KB Output is correct
44 Correct 36 ms 276 KB Output is correct
45 Correct 26 ms 344 KB Output is correct
46 Correct 27 ms 300 KB Output is correct
47 Correct 28 ms 304 KB Output is correct
48 Correct 23 ms 296 KB Output is correct