oj.uz

Submission #1078966

# Submission time Handle Problem Language Result Execution time Memory
1078966 2024-08-28T08:44:23 Z Gromp15 Rarest Insects (IOI22_insects) C++17
70.61 / 100
 105 ms 1188 KB 
#include <bits/stdc++.h>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#include "insects.h"
using namespace std;
template<typename T> bool ckmin(T &a, const T &b) { return a > b ? a = b, 1 : 0; }
template<typename T> bool ckmax(T &a, const T &b) { return a < b ? a = b, 1 : 0; }

int min_cardinality(int N) {
	vector<int> idx(N);
	iota(all(idx), 0);
	shuffle(all(idx), mt19937(1498371));
	vector<int> groups{idx[0]};
	move_inside(idx[0]);
	for (int i = 1; i < N; i++) {
		move_inside(idx[i]);
		if (press_button() > 1) move_outside(idx[i]);
		else groups.push_back(idx[i]);
	}
	for (int x : groups) move_outside(x);
	int ans = 1e9;
	auto solve = [&](auto&& s, vector<int> v, vector<int> pot) -> void {
		if (sz(v) == 1) {
			ckmin(ans, sz(pot)); return;
		}
		if (sz(v) * sz(v) < sz(pot) * 2) {
			vector<int> hf(v.begin(), v.begin() + sz(v) / 2), other(v.begin() + sz(v) / 2, v.end());
			for (int x : hf) move_inside(x);
			vector<int> A, B;
			for (int x : pot) {
				if (find(all(hf), x) != hf.end()) A.emplace_back(x);
				else {
					move_inside(x);
					if (press_button() > 1) {
						A.emplace_back(x);
					}
					else {
						B.emplace_back(x);
					}
					move_outside(x);
				}
			}
			for (int x : hf) move_outside(x);
			s(s, hf, A);
			s(s, other, B);
			return;
		}
		int l = 2, r = sz(pot) / sz(v), ans2 = 1;
		while (l <= r) {
			int mid = (l+r)/2;
			vector<int> got;
			for (int x : pot) {
				move_inside(x);
				if (press_button() > mid) move_outside(x);
				else got.push_back(x);
			}
			if (sz(got) == mid * sz(v)) ans2 = mid, l = mid+1;
			else r = mid-1;
			for (int x : got) move_outside(x);
		}
		ckmin(ans, ans2);
	};
	solve(solve, groups, idx);
	return ans;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 5 ms 444 KB Output is correct
9 Correct 4 ms 600 KB Output is correct
10 Correct 4 ms 344 KB Output is correct
11 Correct 2 ms 600 KB Output is correct
12 Correct 3 ms 344 KB Output is correct
13 Correct 6 ms 344 KB Output is correct
14 Correct 3 ms 344 KB Output is correct
15 Correct 3 ms 344 KB Output is correct
16 Correct 4 ms 344 KB Output is correct
17 Correct 4 ms 436 KB Output is correct
18 Correct 7 ms 600 KB Output is correct
19 Correct 5 ms 344 KB Output is correct
20 Correct 3 ms 344 KB Output is correct
21 Correct 3 ms 344 KB Output is correct
22 Correct 1 ms 344 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 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 5 ms 444 KB Output is correct
9 Correct 4 ms 600 KB Output is correct
10 Correct 4 ms 344 KB Output is correct
11 Correct 2 ms 600 KB Output is correct
12 Correct 3 ms 344 KB Output is correct
13 Correct 6 ms 344 KB Output is correct
14 Correct 3 ms 344 KB Output is correct
15 Correct 3 ms 344 KB Output is correct
16 Correct 4 ms 344 KB Output is correct
17 Correct 4 ms 436 KB Output is correct
18 Correct 7 ms 600 KB Output is correct
19 Correct 5 ms 344 KB Output is correct
20 Correct 3 ms 344 KB Output is correct
21 Correct 3 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 4 ms 340 KB Output is correct
24 Correct 6 ms 600 KB Output is correct
25 Correct 31 ms 344 KB Output is correct
26 Correct 31 ms 440 KB Output is correct
27 Correct 9 ms 600 KB Output is correct
28 Correct 3 ms 444 KB Output is correct
29 Correct 14 ms 708 KB Output is correct
30 Correct 33 ms 444 KB Output is correct
31 Correct 19 ms 344 KB Output is correct
32 Correct 13 ms 344 KB Output is correct
33 Correct 27 ms 936 KB Output is correct
34 Correct 22 ms 344 KB Output is correct
35 Correct 33 ms 932 KB Output is correct
36 Correct 19 ms 344 KB Output is correct
37 Correct 30 ms 600 KB Output is correct
38 Correct 17 ms 344 KB Output is correct
39 Correct 14 ms 444 KB Output is correct
40 Correct 13 ms 452 KB Output is correct
41 Correct 4 ms 344 KB Output is correct

Subtask #3
45.61 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 9 ms 444 KB Output is correct
8 Correct 7 ms 600 KB Output is correct
9 Partially correct 86 ms 960 KB Output is partially correct
10 Partially correct 73 ms 468 KB Output is partially correct
11 Correct 29 ms 600 KB Output is correct
12 Correct 29 ms 592 KB Output is correct
13 Partially correct 42 ms 592 KB Output is partially correct
14 Partially correct 105 ms 948 KB Output is partially correct
15 Partially correct 23 ms 448 KB Output is partially correct
16 Partially correct 45 ms 444 KB Output is partially correct
17 Partially correct 51 ms 448 KB Output is partially correct
18 Partially correct 46 ms 940 KB Output is partially correct
19 Partially correct 54 ms 712 KB Output is partially correct
20 Partially correct 59 ms 688 KB Output is partially correct
21 Partially correct 83 ms 592 KB Output is partially correct
22 Partially correct 62 ms 676 KB Output is partially correct
23 Partially correct 58 ms 592 KB Output is partially correct
24 Correct 32 ms 592 KB Output is correct
25 Correct 20 ms 344 KB Output is correct
26 Correct 6 ms 344 KB Output is correct
27 Partially correct 72 ms 1188 KB Output is partially correct
28 Partially correct 73 ms 704 KB Output is partially correct
29 Partially correct 72 ms 344 KB Output is partially correct
30 Partially correct 68 ms 680 KB Output is partially correct
31 Partially correct 67 ms 720 KB Output is partially correct
32 Partially correct 76 ms 592 KB Output is partially correct
33 Partially correct 61 ms 420 KB Output is partially correct
34 Partially correct 60 ms 676 KB Output is partially correct
35 Partially correct 80 ms 592 KB Output is partially correct
36 Partially correct 80 ms 936 KB Output is partially correct
37 Partially correct 73 ms 936 KB Output is partially correct
38 Partially correct 94 ms 592 KB Output is partially correct
39 Partially correct 51 ms 832 KB Output is partially correct
40 Partially correct 49 ms 692 KB Output is partially correct
41 Partially correct 80 ms 684 KB Output is partially correct
42 Partially correct 74 ms 588 KB Output is partially correct
43 Partially correct 8 ms 344 KB Output is partially correct
44 Partially correct 36 ms 696 KB Output is partially correct
45 Correct 18 ms 344 KB Output is correct
46 Correct 14 ms 452 KB Output is correct
47 Correct 25 ms 856 KB Output is correct
48 Correct 18 ms 440 KB Output is correct