Submission #835469

# Submission time Handle Problem Language Result Execution time Memory
835469 2023-08-23T14:52:35 Z pavement Rarest Insects (IOI22_insects) C++17
93.52 / 100
142 ms 512 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;
	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;
}
# 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 1 ms 208 KB Output is correct
6 Correct 5 ms 336 KB Output is correct
7 Correct 2 ms 336 KB Output is correct
8 Correct 5 ms 336 KB Output is correct
9 Correct 7 ms 208 KB Output is correct
10 Correct 3 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 4 ms 208 KB Output is correct
13 Correct 4 ms 208 KB Output is correct
14 Correct 6 ms 460 KB Output is correct
15 Correct 6 ms 300 KB Output is correct
16 Correct 8 ms 208 KB Output is correct
17 Correct 4 ms 208 KB Output is correct
18 Correct 5 ms 208 KB Output is correct
19 Correct 6 ms 296 KB Output is correct
20 Correct 3 ms 208 KB Output is correct
21 Correct 3 ms 208 KB Output is correct
22 Correct 2 ms 208 KB Output is correct
# 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 1 ms 208 KB Output is correct
6 Correct 5 ms 336 KB Output is correct
7 Correct 2 ms 336 KB Output is correct
8 Correct 5 ms 336 KB Output is correct
9 Correct 7 ms 208 KB Output is correct
10 Correct 3 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 4 ms 208 KB Output is correct
13 Correct 4 ms 208 KB Output is correct
14 Correct 6 ms 460 KB Output is correct
15 Correct 6 ms 300 KB Output is correct
16 Correct 8 ms 208 KB Output is correct
17 Correct 4 ms 208 KB Output is correct
18 Correct 5 ms 208 KB Output is correct
19 Correct 6 ms 296 KB Output is correct
20 Correct 3 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 25 ms 376 KB Output is correct
24 Correct 12 ms 384 KB Output is correct
25 Correct 26 ms 376 KB Output is correct
26 Correct 38 ms 440 KB Output is correct
27 Correct 28 ms 328 KB Output is correct
28 Correct 11 ms 336 KB Output is correct
29 Correct 32 ms 328 KB Output is correct
30 Correct 24 ms 336 KB Output is correct
31 Correct 26 ms 336 KB Output is correct
32 Correct 66 ms 300 KB Output is correct
33 Correct 63 ms 372 KB Output is correct
34 Correct 30 ms 380 KB Output is correct
35 Correct 29 ms 336 KB Output is correct
36 Correct 32 ms 380 KB Output is correct
37 Correct 34 ms 336 KB Output is correct
38 Correct 34 ms 308 KB Output is correct
39 Correct 30 ms 336 KB Output is correct
40 Correct 23 ms 348 KB Output is correct
41 Correct 15 ms 336 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 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 0 ms 208 KB Output is correct
7 Correct 56 ms 328 KB Output is correct
8 Correct 53 ms 380 KB Output is correct
9 Correct 75 ms 348 KB Output is correct
10 Partially correct 134 ms 400 KB Output is partially correct
11 Correct 61 ms 276 KB Output is correct
12 Correct 52 ms 368 KB Output is correct
13 Correct 62 ms 368 KB Output is correct
14 Correct 69 ms 328 KB Output is correct
15 Partially correct 137 ms 416 KB Output is partially correct
16 Partially correct 137 ms 512 KB Output is partially correct
17 Partially correct 134 ms 308 KB Output is partially correct
18 Partially correct 114 ms 392 KB Output is partially correct
19 Partially correct 110 ms 408 KB Output is partially correct
20 Partially correct 140 ms 328 KB Output is partially correct
21 Partially correct 98 ms 420 KB Output is partially correct
22 Partially correct 107 ms 388 KB Output is partially correct
23 Correct 66 ms 472 KB Output is correct
24 Correct 46 ms 356 KB Output is correct
25 Correct 48 ms 372 KB Output is correct
26 Correct 35 ms 336 KB Output is correct
27 Correct 76 ms 408 KB Output is correct
28 Correct 57 ms 416 KB Output is correct
29 Correct 95 ms 328 KB Output is correct
30 Correct 104 ms 508 KB Output is correct
31 Partially correct 121 ms 420 KB Output is partially correct
32 Partially correct 132 ms 512 KB Output is partially correct
33 Correct 76 ms 308 KB Output is correct
34 Correct 56 ms 368 KB Output is correct
35 Partially correct 90 ms 396 KB Output is partially correct
36 Correct 83 ms 368 KB Output is correct
37 Partially correct 142 ms 328 KB Output is partially correct
38 Partially correct 129 ms 408 KB Output is partially correct
39 Correct 81 ms 388 KB Output is correct
40 Correct 52 ms 296 KB Output is correct
41 Correct 87 ms 420 KB Output is correct
42 Partially correct 87 ms 380 KB Output is partially correct
43 Correct 13 ms 304 KB Output is correct
44 Correct 39 ms 328 KB Output is correct
45 Correct 55 ms 392 KB Output is correct
46 Correct 45 ms 364 KB Output is correct
47 Correct 50 ms 336 KB Output is correct
48 Correct 50 ms 380 KB Output is correct