oj.uz

Submission #628611

# Submission time Handle Problem Language Result Execution time Memory
628611 2022-08-13T14:29:04 Z galca Rarest Insects (IOI22_insects) C++17
25 / 100
 375 ms 336 KB 
#include "insects.h"
#include <vector>

using namespace std;

int min_cardinality(int N) {
	vector<int> vec1;
	vector<int> vec2;

	for (int i = 0; i < N; i++) {
		vec1.push_back(i);
	}
	
	vector<int> distinct;
	for (int i = 0; i < vec1.size(); i++) {
		move_inside(vec1[i]);
		int res = press_button();
		if (res != 1) {
			move_outside(vec1[i]);
			vec2.push_back(vec1[i]);
		}
		else {
			distinct.push_back(vec1[i]);
		}
	}

	int num_sets = distinct.size();
	if (num_sets == N) {
		return 1;
	}

	for (int i = 0; i < distinct.size(); i++) {
		move_outside(distinct[i]);
	}

	int sqrtN = 1;
	for (sqrtN = 1; sqrtN*sqrtN < N; sqrtN++);

	if (num_sets > sqrtN) {
		distinct.erase(distinct.begin(), distinct.end());
		vec1.erase(vec1.begin(), vec1.end());

		int dir = 1;
		int iter = 1;
		while ((vec1.size() + vec2.size()) > 0) {

			vector<int>& src = dir ? vec2 : vec1;
			vector<int>& dst = dir ? vec1 : vec2;

			vector<int> distinct;
			for (int i = 0; i < src.size(); i++) {
				move_inside(src[i]);
				int res = press_button();
				if (res != 1) {
					move_outside(src[i]);
					dst.push_back(src[i]);
				}
				else {
					distinct.push_back(src[i]);
				}
			}
			if (distinct.size() != num_sets) {
				return iter;
			}

			for (int i = 0; i < distinct.size(); i++) {
				move_outside(distinct[i]);
			}

			distinct.erase(distinct.begin(), distinct.end());
			src.erase(src.begin(), src.end());
			dir ^= 1;

			++iter;
		}

		return iter;
	}
	else {
		int min_card = N;
		int dir = 0;
		vec2.erase(vec2.begin(), vec2.end());

		while ((vec1.size() + vec2.size()) > 0) {
			vector<int>& src = dir ? vec2 : vec1;
			vector<int>& dst = dir ? vec1 : vec2;

			move_inside(src[0]);
			int size = 1;
			for (int i = 1; i < src.size(); i++) {
				move_inside(src[i]);
				int res = press_button();
				if (res != 2) {
					dst.push_back(src[i]);
				}
				else {
					++size;
				}
				move_outside(src[i]);
			}
			move_outside(src[0]);

			if (size < min_card) {
				min_card = size;
			}
			src.erase(src.begin(), src.end());
			dir ^= 1;

			if (size == 1) {
				return 1;
			}
		}

		return min_card;
	}
}

Compilation message

insects.cpp: In function 'int min_cardinality(int)':
insects.cpp:15:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   15 |  for (int i = 0; i < vec1.size(); i++) {
      |                  ~~^~~~~~~~~~~~~
insects.cpp:32:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |  for (int i = 0; i < distinct.size(); i++) {
      |                  ~~^~~~~~~~~~~~~~~~~
insects.cpp:51:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |    for (int i = 0; i < src.size(); i++) {
      |                    ~~^~~~~~~~~~~~
insects.cpp:62:24: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   62 |    if (distinct.size() != num_sets) {
      |        ~~~~~~~~~~~~~~~~^~~~~~~~~~~
insects.cpp:66:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |    for (int i = 0; i < distinct.size(); i++) {
      |                    ~~^~~~~~~~~~~~~~~~~
insects.cpp:90:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   90 |    for (int i = 1; i < src.size(); i++) {
      |                    ~~^~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory 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 4 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 17 ms 208 KB Output is correct
9 Correct 15 ms 208 KB Output is correct
10 Correct 4 ms 208 KB Output is correct
11 Correct 3 ms 208 KB Output is correct
12 Correct 8 ms 208 KB Output is correct
13 Correct 14 ms 208 KB Output is correct
14 Correct 6 ms 208 KB Output is correct
15 Correct 11 ms 208 KB Output is correct
16 Correct 12 ms 208 KB Output is correct
17 Correct 16 ms 208 KB Output is correct
18 Correct 5 ms 208 KB Output is correct
19 Correct 7 ms 208 KB Output is correct
20 Correct 3 ms 208 KB Output is correct
21 Correct 5 ms 208 KB Output is correct
22 Correct 3 ms 208 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory 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 4 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 17 ms 208 KB Output is correct
9 Correct 15 ms 208 KB Output is correct
10 Correct 4 ms 208 KB Output is correct
11 Correct 3 ms 208 KB Output is correct
12 Correct 8 ms 208 KB Output is correct
13 Correct 14 ms 208 KB Output is correct
14 Correct 6 ms 208 KB Output is correct
15 Correct 11 ms 208 KB Output is correct
16 Correct 12 ms 208 KB Output is correct
17 Correct 16 ms 208 KB Output is correct
18 Correct 5 ms 208 KB Output is correct
19 Correct 7 ms 208 KB Output is correct
20 Correct 3 ms 208 KB Output is correct
21 Correct 5 ms 208 KB Output is correct
22 Correct 3 ms 208 KB Output is correct
23 Correct 12 ms 208 KB Output is correct
24 Correct 8 ms 300 KB Output is correct
25 Correct 160 ms 300 KB Output is correct
26 Correct 113 ms 300 KB Output is correct
27 Correct 20 ms 300 KB Output is correct
28 Correct 10 ms 208 KB Output is correct
29 Correct 27 ms 208 KB Output is correct
30 Correct 150 ms 208 KB Output is correct
31 Correct 31 ms 296 KB Output is correct
32 Correct 49 ms 208 KB Output is correct
33 Correct 62 ms 336 KB Output is correct
34 Correct 62 ms 208 KB Output is correct
35 Correct 100 ms 208 KB Output is correct
36 Correct 69 ms 208 KB Output is correct
37 Correct 36 ms 300 KB Output is correct
38 Correct 14 ms 208 KB Output is correct
39 Correct 14 ms 284 KB Output is correct
40 Correct 17 ms 208 KB Output is correct
41 Correct 11 ms 208 KB Output is correct

Subtask #3
0 / 75.0

# Verdict Execution time Memory 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 0 ms 208 KB Output is correct
7 Correct 37 ms 304 KB Output is correct
8 Correct 21 ms 284 KB Output is correct
9 Incorrect 375 ms 304 KB Too many queries.
10 Halted 0 ms 0 KB -