oj.uz

Submission #1029086

# Submission time Handle Problem Language Result Execution time Memory
1029086 2024-07-20T12:12:25 Z 42kangaroo Rarest Insects (IOI22_insects) C++17
99.82 / 100
 42 ms 1004 KB 
#include "insects.h"
#include "bits/stdc++.h"

using namespace std;

int min_cardinality(int N) {
	set<int> inside, outside, aIn;
	for (int i = 0; i < N; ++i) {
		move_inside(i);
		if (press_button() > 1) {
			if (i == N - 1) {
				aIn.insert(i);
			} else {
				outside.insert(i);
				move_outside(i);
			}
		} else {
			inside.insert(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 {
				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;
		}
	}
	return l;
}

Compilation message

insects.cpp: In function 'int min_cardinality(int)':
insects.cpp:27:50: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   27 |    if ((inside.size() + nIn.size() + aIn.size()) == m * k) {
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~
insects.cpp:37:49: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   37 |   if ((inside.size() + nIn.size() + aIn.size()) == m * k) {
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~

Subtask #1
10.0 / 10.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 2 ms 344 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 1 ms 448 KB Output is correct
9 Correct 1 ms 692 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 4 ms 600 KB Output is correct
13 Correct 4 ms 344 KB Output is correct
14 Correct 2 ms 344 KB Output is correct
15 Correct 4 ms 344 KB Output is correct
16 Correct 2 ms 344 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 4 ms 344 KB Output is correct
19 Correct 2 ms 344 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 2 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 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 1 ms 448 KB Output is correct
9 Correct 1 ms 692 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 4 ms 600 KB Output is correct
13 Correct 4 ms 344 KB Output is correct
14 Correct 2 ms 344 KB Output is correct
15 Correct 4 ms 344 KB Output is correct
16 Correct 2 ms 344 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 4 ms 344 KB Output is correct
19 Correct 2 ms 344 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 2 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 8 ms 448 KB Output is correct
24 Correct 2 ms 344 KB Output is correct
25 Correct 9 ms 760 KB Output is correct
26 Correct 10 ms 600 KB Output is correct
27 Correct 6 ms 344 KB Output is correct
28 Correct 4 ms 344 KB Output is correct
29 Correct 13 ms 992 KB Output is correct
30 Correct 18 ms 472 KB Output is correct
31 Correct 12 ms 700 KB Output is correct
32 Correct 9 ms 344 KB Output is correct
33 Correct 7 ms 856 KB Output is correct
34 Correct 17 ms 856 KB Output is correct
35 Correct 14 ms 344 KB Output is correct
36 Correct 17 ms 600 KB Output is correct
37 Correct 17 ms 600 KB Output is correct
38 Correct 6 ms 496 KB Output is correct
39 Correct 10 ms 344 KB Output is correct
40 Correct 9 ms 344 KB Output is correct
41 Correct 3 ms 448 KB Output is correct

Subtask #3
74.82 / 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 21 ms 504 KB Output is correct
8 Correct 9 ms 344 KB Output is correct
9 Correct 34 ms 708 KB Output is correct
10 Correct 28 ms 852 KB Output is correct
11 Correct 23 ms 856 KB Output is correct
12 Correct 20 ms 600 KB Output is correct
13 Correct 30 ms 600 KB Output is correct
14 Correct 33 ms 1000 KB Output is correct
15 Correct 33 ms 592 KB Output is correct
16 Correct 21 ms 844 KB Output is correct
17 Correct 25 ms 600 KB Output is correct
18 Correct 25 ms 800 KB Output is correct
19 Correct 20 ms 548 KB Output is correct
20 Correct 30 ms 600 KB Output is correct
21 Correct 24 ms 748 KB Output is correct
22 Correct 34 ms 592 KB Output is correct
23 Correct 36 ms 848 KB Output is correct
24 Correct 22 ms 600 KB Output is correct
25 Correct 17 ms 592 KB Output is correct
26 Correct 6 ms 344 KB Output is correct
27 Correct 30 ms 636 KB Output is correct
28 Correct 13 ms 600 KB Output is correct
29 Correct 26 ms 692 KB Output is correct
30 Correct 28 ms 592 KB Output is correct
31 Correct 18 ms 592 KB Output is correct
32 Correct 42 ms 600 KB Output is correct
33 Partially correct 27 ms 600 KB Output is partially correct
34 Correct 35 ms 856 KB Output is correct
35 Correct 23 ms 752 KB Output is correct
36 Correct 18 ms 556 KB Output is correct
37 Correct 35 ms 600 KB Output is correct
38 Correct 31 ms 860 KB Output is correct
39 Correct 14 ms 600 KB Output is correct
40 Correct 21 ms 520 KB Output is correct
41 Correct 24 ms 772 KB Output is correct
42 Correct 31 ms 600 KB Output is correct
43 Correct 9 ms 344 KB Output is correct
44 Correct 24 ms 1004 KB Output is correct
45 Correct 16 ms 592 KB Output is correct
46 Correct 11 ms 712 KB Output is correct
47 Correct 12 ms 524 KB Output is correct
48 Correct 13 ms 500 KB Output is correct