oj.uz

답안 #1078951

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1078951 2024-08-28T08:34:45 Z Gromp15 드문 곤충 (IOI22_insects) C++17
70 / 100
 94 ms 1108 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> groups{0};
	move_inside(0);
	for (int i = 1; i < N; i++) {
		move_inside(i);
		if (press_button() > 1) move_outside(i);
		else groups.push_back(i);
	}
	for (int x : groups) move_outside(x);
	if (sz(groups) >= 55) {
		int l = 2, r = N / sz(groups), ans = 1;
		while (l <= r) {
			int mid = (l+r)/2;
			vector<int> got;
			for (int i = 0; i < N; i++) {
				move_inside(i);
				if (press_button() > mid) move_outside(i);
				else got.push_back(i);
			}
			if (sz(got) == mid * sz(groups)) ans = mid, l = mid+1;
			else r = mid-1;
			for (int x : got) move_outside(x);
		}
		return ans;
	}
	int ans = 1e9;
	auto solve = [&](auto&& s, vector<int> v, vector<int> pot) -> void {
		if (sz(v) == 1) {
			ckmin(ans, sz(pot)); return;
		}
		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);
	};
	vector<int> tot(N);
	iota(all(tot), 0);
	solve(solve, groups, tot);
	return ans;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 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 1 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 4 ms 344 KB Output is correct
9 Correct 3 ms 344 KB Output is correct
10 Correct 3 ms 432 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 3 ms 344 KB Output is correct
13 Correct 4 ms 436 KB Output is correct
14 Correct 3 ms 344 KB Output is correct
15 Correct 3 ms 344 KB Output is correct
16 Correct 3 ms 344 KB Output is correct
17 Correct 4 ms 344 KB Output is correct
18 Correct 5 ms 600 KB Output is correct
19 Correct 5 ms 344 KB Output is correct
20 Correct 7 ms 344 KB Output is correct
21 Correct 2 ms 344 KB Output is correct
22 Correct 1 ms 600 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 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 1 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 4 ms 344 KB Output is correct
9 Correct 3 ms 344 KB Output is correct
10 Correct 3 ms 432 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 3 ms 344 KB Output is correct
13 Correct 4 ms 436 KB Output is correct
14 Correct 3 ms 344 KB Output is correct
15 Correct 3 ms 344 KB Output is correct
16 Correct 3 ms 344 KB Output is correct
17 Correct 4 ms 344 KB Output is correct
18 Correct 5 ms 600 KB Output is correct
19 Correct 5 ms 344 KB Output is correct
20 Correct 7 ms 344 KB Output is correct
21 Correct 2 ms 344 KB Output is correct
22 Correct 1 ms 600 KB Output is correct
23 Correct 6 ms 344 KB Output is correct
24 Correct 4 ms 344 KB Output is correct
25 Correct 26 ms 464 KB Output is correct
26 Correct 29 ms 704 KB Output is correct
27 Correct 14 ms 344 KB Output is correct
28 Correct 7 ms 344 KB Output is correct
29 Correct 17 ms 428 KB Output is correct
30 Correct 32 ms 344 KB Output is correct
31 Correct 12 ms 692 KB Output is correct
32 Correct 27 ms 436 KB Output is correct
33 Correct 17 ms 452 KB Output is correct
34 Correct 25 ms 344 KB Output is correct
35 Correct 25 ms 344 KB Output is correct
36 Correct 35 ms 600 KB Output is correct
37 Correct 40 ms 600 KB Output is correct
38 Correct 18 ms 344 KB Output is correct
39 Correct 18 ms 344 KB Output is correct
40 Correct 12 ms 440 KB Output is correct
41 Correct 4 ms 344 KB Output is correct

Subtask #3
45.0 / 75.0

# 결과 실행 시간 메모리 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 0 ms 344 KB Output is correct
7 Correct 11 ms 428 KB Output is correct
8 Correct 7 ms 444 KB Output is correct
9 Partially correct 89 ms 436 KB Output is partially correct
10 Partially correct 84 ms 928 KB Output is partially correct
11 Correct 16 ms 424 KB Output is correct
12 Correct 29 ms 592 KB Output is correct
13 Partially correct 23 ms 692 KB Output is partially correct
14 Partially correct 70 ms 600 KB Output is partially correct
15 Partially correct 39 ms 960 KB Output is partially correct
16 Partially correct 46 ms 424 KB Output is partially correct
17 Partially correct 47 ms 892 KB Output is partially correct
18 Partially correct 53 ms 592 KB Output is partially correct
19 Partially correct 42 ms 700 KB Output is partially correct
20 Partially correct 61 ms 708 KB Output is partially correct
21 Partially correct 94 ms 668 KB Output is partially correct
22 Partially correct 58 ms 344 KB Output is partially correct
23 Partially correct 43 ms 672 KB Output is partially correct
24 Correct 29 ms 344 KB Output is correct
25 Correct 26 ms 432 KB Output is correct
26 Correct 9 ms 440 KB Output is correct
27 Partially correct 76 ms 928 KB Output is partially correct
28 Partially correct 69 ms 600 KB Output is partially correct
29 Partially correct 52 ms 684 KB Output is partially correct
30 Partially correct 62 ms 1108 KB Output is partially correct
31 Partially correct 78 ms 592 KB Output is partially correct
32 Partially correct 59 ms 680 KB Output is partially correct
33 Partially correct 54 ms 680 KB Output is partially correct
34 Partially correct 58 ms 344 KB Output is partially correct
35 Partially correct 56 ms 592 KB Output is partially correct
36 Partially correct 83 ms 588 KB Output is partially correct
37 Partially correct 68 ms 592 KB Output is partially correct
38 Partially correct 72 ms 844 KB Output is partially correct
39 Partially correct 47 ms 428 KB Output is partially correct
40 Partially correct 58 ms 596 KB Output is partially correct
41 Partially correct 85 ms 844 KB Output is partially correct
42 Partially correct 88 ms 428 KB Output is partially correct
43 Partially correct 6 ms 436 KB Output is partially correct
44 Partially correct 28 ms 436 KB Output is partially correct
45 Correct 19 ms 344 KB Output is correct
46 Correct 21 ms 672 KB Output is correct
47 Correct 13 ms 596 KB Output is correct
48 Correct 27 ms 680 KB Output is correct