답안 #1029096

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1029096 2024-07-20T12:22:52 Z 42kangaroo 드문 곤충 (IOI22_insects) C++17
99.86 / 100
45 ms 956 KB
#include "insects.h"
#include "bits/stdc++.h"

using namespace std;

int min_cardinality(int N) {
	int nums = 0;
	set<int> inside, outside, aIn;
	vector<int> o(N);
	std::iota(o.begin(), o.end(),0);
	std::random_shuffle(o.begin(), o.end());
	for (int i = 0; i < N; ++i) {
		nums++;
		move_inside(o[i]);
		if (press_button() > 1) {
			if (i == N - 1) {
				aIn.insert(o[i]);
			} else {
				outside.insert(o[i]);
				move_outside(o[i]);
			}
		} else {
			if (i == N - 1) return 1;
			inside.insert(o[i]);
		}
	}
	int k = inside.size();
	int l = 1, r = N / k + 1;
	while (l + 1 < r) {
		int m = (l + r + 1) / 2;
		set<int> nIn, nOut;
		for (auto e: outside) {
			if ((inside.size() + nIn.size() + aIn.size()) == m * k) {
				nOut.insert(e);
			} else {
				nums++;
				move_inside(e);
				if (press_button() > m) {
					nOut.insert(e);
					move_outside(e);
				} else nIn.insert(e);
			}
		}
		if ((inside.size() + nIn.size() + aIn.size()) == m * k) {
			l = m;
			outside = nOut;
			inside.insert(nIn.begin(), nIn.end());
			inside.insert(aIn.begin(), aIn.end());
			aIn.clear();
		} else {
			r = min(m, (int)(inside.size() + nIn.size() + aIn.size())/k + 1);
			int nM = (l + r + 1) / 2 - l;
			nIn.insert(aIn.begin(), aIn.end());
			aIn.clear();
			for (int i = 0; i < nM && !nIn.empty(); ++i) {
				aIn.insert(*nIn.begin());
				nIn.erase(nIn.begin());
			}
			for (auto e: nIn) {
				move_outside(e);
			}
			outside = nIn;
		}
	}
	//if ((double)nums/(double)N > 3) return 0;
	return l;
}

Compilation message

insects.cpp: In function 'int min_cardinality(int)':
insects.cpp:33:50: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   33 |    if ((inside.size() + nIn.size() + aIn.size()) == m * k) {
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~
insects.cpp:44:49: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   44 |   if ((inside.size() + nIn.size() + aIn.size()) == m * k) {
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~
# 결과 실행 시간 메모리 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 2 ms 344 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 3 ms 600 KB Output is correct
9 Correct 3 ms 448 KB Output is correct
10 Correct 4 ms 344 KB Output is correct
11 Correct 2 ms 600 KB Output is correct
12 Correct 5 ms 344 KB Output is correct
13 Correct 3 ms 448 KB Output is correct
14 Correct 3 ms 344 KB Output is correct
15 Correct 2 ms 456 KB Output is correct
16 Correct 3 ms 448 KB Output is correct
17 Correct 3 ms 344 KB Output is correct
18 Correct 4 ms 448 KB Output is correct
19 Correct 2 ms 344 KB Output is correct
20 Correct 2 ms 344 KB Output is correct
21 Correct 2 ms 440 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
# 결과 실행 시간 메모리 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 2 ms 344 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 3 ms 600 KB Output is correct
9 Correct 3 ms 448 KB Output is correct
10 Correct 4 ms 344 KB Output is correct
11 Correct 2 ms 600 KB Output is correct
12 Correct 5 ms 344 KB Output is correct
13 Correct 3 ms 448 KB Output is correct
14 Correct 3 ms 344 KB Output is correct
15 Correct 2 ms 456 KB Output is correct
16 Correct 3 ms 448 KB Output is correct
17 Correct 3 ms 344 KB Output is correct
18 Correct 4 ms 448 KB Output is correct
19 Correct 2 ms 344 KB Output is correct
20 Correct 2 ms 344 KB Output is correct
21 Correct 2 ms 440 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 11 ms 600 KB Output is correct
24 Correct 5 ms 344 KB Output is correct
25 Correct 13 ms 616 KB Output is correct
26 Correct 18 ms 600 KB Output is correct
27 Correct 11 ms 344 KB Output is correct
28 Correct 5 ms 344 KB Output is correct
29 Correct 16 ms 956 KB Output is correct
30 Correct 20 ms 480 KB Output is correct
31 Correct 17 ms 696 KB Output is correct
32 Correct 12 ms 344 KB Output is correct
33 Correct 14 ms 656 KB Output is correct
34 Correct 12 ms 344 KB Output is correct
35 Correct 10 ms 700 KB Output is correct
36 Correct 11 ms 344 KB Output is correct
37 Correct 10 ms 344 KB Output is correct
38 Correct 13 ms 344 KB Output is correct
39 Correct 11 ms 344 KB Output is correct
40 Correct 7 ms 344 KB Output is correct
41 Correct 5 ms 344 KB Output is correct
# 결과 실행 시간 메모리 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 596 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 22 ms 596 KB Output is correct
8 Correct 8 ms 340 KB Output is correct
9 Correct 27 ms 700 KB Output is correct
10 Correct 40 ms 748 KB Output is correct
11 Correct 15 ms 592 KB Output is correct
12 Correct 11 ms 776 KB Output is correct
13 Correct 39 ms 592 KB Output is correct
14 Correct 42 ms 596 KB Output is correct
15 Correct 26 ms 588 KB Output is correct
16 Correct 19 ms 752 KB Output is correct
17 Correct 29 ms 856 KB Output is correct
18 Correct 17 ms 592 KB Output is correct
19 Correct 30 ms 508 KB Output is correct
20 Correct 19 ms 536 KB Output is correct
21 Correct 32 ms 600 KB Output is correct
22 Correct 24 ms 600 KB Output is correct
23 Correct 23 ms 344 KB Output is correct
24 Correct 29 ms 600 KB Output is correct
25 Correct 21 ms 956 KB Output is correct
26 Correct 9 ms 344 KB Output is correct
27 Correct 30 ms 592 KB Output is correct
28 Correct 21 ms 516 KB Output is correct
29 Correct 28 ms 452 KB Output is correct
30 Correct 25 ms 600 KB Output is correct
31 Correct 27 ms 600 KB Output is correct
32 Correct 45 ms 460 KB Output is correct
33 Partially correct 30 ms 584 KB Output is partially correct
34 Partially correct 45 ms 696 KB Output is partially correct
35 Correct 28 ms 852 KB Output is correct
36 Correct 36 ms 592 KB Output is correct
37 Correct 36 ms 600 KB Output is correct
38 Correct 30 ms 592 KB Output is correct
39 Correct 29 ms 624 KB Output is correct
40 Correct 25 ms 608 KB Output is correct
41 Correct 23 ms 592 KB Output is correct
42 Correct 38 ms 696 KB Output is correct
43 Correct 7 ms 344 KB Output is correct
44 Correct 29 ms 720 KB Output is correct
45 Correct 18 ms 596 KB Output is correct
46 Correct 9 ms 344 KB Output is correct
47 Correct 19 ms 344 KB Output is correct
48 Correct 11 ms 600 KB Output is correct