답안 #835464

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
835464 2023-08-23T14:49:57 Z pavement 드문 곤충 (IOI22_insects) C++17
90.3 / 100
205 ms 520 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 = min((int)insects.size() / (int)v.size(), (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)) {
				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;
			hi = mid - 1;
			for (auto i : to_remove) {
				my_move_outside(i);
				insects.pb(i);
			}
			alr_in.clear();
		}		
	}
	return ans;
}
# 결과 실행 시간 메모리 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 344 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 5 ms 304 KB Output is correct
9 Correct 8 ms 312 KB Output is correct
10 Correct 4 ms 300 KB Output is correct
11 Correct 3 ms 208 KB Output is correct
12 Correct 6 ms 208 KB Output is correct
13 Correct 3 ms 296 KB Output is correct
14 Correct 9 ms 296 KB Output is correct
15 Correct 9 ms 336 KB Output is correct
16 Correct 5 ms 300 KB Output is correct
17 Correct 4 ms 312 KB Output is correct
18 Correct 5 ms 260 KB Output is correct
19 Correct 5 ms 208 KB Output is correct
20 Correct 4 ms 208 KB Output is correct
21 Correct 5 ms 308 KB Output is correct
22 Correct 2 ms 208 KB Output is correct
# 결과 실행 시간 메모리 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 344 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 5 ms 304 KB Output is correct
9 Correct 8 ms 312 KB Output is correct
10 Correct 4 ms 300 KB Output is correct
11 Correct 3 ms 208 KB Output is correct
12 Correct 6 ms 208 KB Output is correct
13 Correct 3 ms 296 KB Output is correct
14 Correct 9 ms 296 KB Output is correct
15 Correct 9 ms 336 KB Output is correct
16 Correct 5 ms 300 KB Output is correct
17 Correct 4 ms 312 KB Output is correct
18 Correct 5 ms 260 KB Output is correct
19 Correct 5 ms 208 KB Output is correct
20 Correct 4 ms 208 KB Output is correct
21 Correct 5 ms 308 KB Output is correct
22 Correct 2 ms 208 KB Output is correct
23 Correct 41 ms 380 KB Output is correct
24 Correct 12 ms 336 KB Output is correct
25 Correct 33 ms 384 KB Output is correct
26 Correct 48 ms 376 KB Output is correct
27 Correct 27 ms 292 KB Output is correct
28 Correct 14 ms 336 KB Output is correct
29 Correct 25 ms 328 KB Output is correct
30 Correct 19 ms 296 KB Output is correct
31 Correct 43 ms 380 KB Output is correct
32 Correct 66 ms 376 KB Output is correct
33 Correct 42 ms 380 KB Output is correct
34 Correct 35 ms 372 KB Output is correct
35 Correct 40 ms 360 KB Output is correct
36 Correct 44 ms 328 KB Output is correct
37 Correct 35 ms 336 KB Output is correct
38 Correct 26 ms 304 KB Output is correct
39 Correct 25 ms 336 KB Output is correct
40 Correct 24 ms 368 KB Output is correct
41 Correct 19 ms 336 KB Output is correct
# 결과 실행 시간 메모리 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 1 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 108 ms 380 KB Output is correct
8 Correct 35 ms 384 KB Output is correct
9 Correct 107 ms 396 KB Output is correct
10 Partially correct 120 ms 388 KB Output is partially correct
11 Correct 64 ms 328 KB Output is correct
12 Correct 67 ms 364 KB Output is correct
13 Correct 64 ms 368 KB Output is correct
14 Correct 65 ms 368 KB Output is correct
15 Partially correct 156 ms 424 KB Output is partially correct
16 Partially correct 188 ms 420 KB Output is partially correct
17 Partially correct 151 ms 392 KB Output is partially correct
18 Partially correct 139 ms 412 KB Output is partially correct
19 Partially correct 205 ms 408 KB Output is partially correct
20 Partially correct 167 ms 420 KB Output is partially correct
21 Partially correct 116 ms 392 KB Output is partially correct
22 Partially correct 115 ms 304 KB Output is partially correct
23 Correct 67 ms 336 KB Output is correct
24 Correct 64 ms 356 KB Output is correct
25 Correct 76 ms 396 KB Output is correct
26 Correct 45 ms 384 KB Output is correct
27 Partially correct 111 ms 408 KB Output is partially correct
28 Partially correct 103 ms 376 KB Output is partially correct
29 Partially correct 103 ms 376 KB Output is partially correct
30 Partially correct 108 ms 392 KB Output is partially correct
31 Partially correct 137 ms 328 KB Output is partially correct
32 Partially correct 128 ms 280 KB Output is partially correct
33 Correct 68 ms 376 KB Output is correct
34 Correct 73 ms 368 KB Output is correct
35 Partially correct 124 ms 404 KB Output is partially correct
36 Partially correct 111 ms 412 KB Output is partially correct
37 Partially correct 143 ms 396 KB Output is partially correct
38 Partially correct 126 ms 392 KB Output is partially correct
39 Partially correct 112 ms 380 KB Output is partially correct
40 Partially correct 101 ms 348 KB Output is partially correct
41 Partially correct 98 ms 520 KB Output is partially correct
42 Partially correct 94 ms 372 KB Output is partially correct
43 Correct 13 ms 208 KB Output is correct
44 Correct 49 ms 284 KB Output is correct
45 Correct 93 ms 416 KB Output is correct
46 Correct 58 ms 384 KB Output is correct
47 Correct 72 ms 364 KB Output is correct
48 Correct 72 ms 372 KB Output is correct