oj.uz

답안 #1029134

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

using namespace std;

int min_cardinality(int N) {
	int nums = 0;
	vector<int> inside, outside, aIn;
	vector<int> o(N);
	std::iota(o.begin(), o.end(),0);
	random_device dev;
	std::shuffle(o.begin(), o.end(), dev);
	for (int i = 0; i < N; ++i) {
		nums++;
		move_inside(o[i]);
		if (press_button() > 1) {
			if (i == N - 1) {
				aIn.push_back(o[i]);
			} else {
				outside.push_back(o[i]);
				move_outside(o[i]);
			}
		} else {
			if (i == N - 1) return 1;
			inside.push_back(o[i]);
		}
	}
	int k = inside.size();
	int l = 1, r = N / k + 1;
	while (l + 1 < r) {
		int m = (l + r + 1) / 2;
		std::shuffle(outside.begin(), outside.end(), dev);
		vector<int> nIn, nOut;
		for (auto e: outside) {
			if ((inside.size() + nIn.size() + aIn.size()) == m * k) {
				nOut.push_back(e);
			} else {
				nums++;
				move_inside(e);
				if (press_button() > m) {
					nOut.push_back(e);
					move_outside(e);
				} else nIn.push_back(e);
			}
		}
		if ((inside.size() + nIn.size() + aIn.size()) == m * k) {
			l = m;
			outside = nOut;
			inside.reserve(inside.size() + nIn.size() + aIn.size());
			inside.insert(inside.end(), nIn.begin(), nIn.end());
			inside.insert(inside.end(), 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.reserve(nIn.size() + aIn.size());
			nIn.insert(nIn.end(), aIn.begin(), aIn.end());
			aIn.clear();
			for (int i = 0; i < nM && !nIn.empty(); ++i) {
				aIn.push_back(nIn.back());
				nIn.pop_back();
			}
			for (auto e: nIn) {
				move_outside(e);
			}
			outside = nIn;
		}
	}
	if ((double)nums/(double)N > 3 && k < 20) return 0;
	return l;
}

Compilation message

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

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 1 ms 504 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 444 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Correct 3 ms 344 KB Output is correct
10 Correct 3 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 2 ms 344 KB Output is correct
13 Correct 3 ms 436 KB Output is correct
14 Correct 2 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 2 ms 344 KB Output is correct
18 Correct 3 ms 344 KB Output is correct
19 Correct 3 ms 504 KB Output is correct
20 Correct 3 ms 344 KB Output is correct
21 Correct 2 ms 596 KB Output is correct
22 Correct 1 ms 344 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 1 ms 504 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 444 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Correct 3 ms 344 KB Output is correct
10 Correct 3 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 2 ms 344 KB Output is correct
13 Correct 3 ms 436 KB Output is correct
14 Correct 2 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 2 ms 344 KB Output is correct
18 Correct 3 ms 344 KB Output is correct
19 Correct 3 ms 504 KB Output is correct
20 Correct 3 ms 344 KB Output is correct
21 Correct 2 ms 596 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 10 ms 596 KB Output is correct
24 Correct 6 ms 344 KB Output is correct
25 Correct 15 ms 852 KB Output is correct
26 Correct 18 ms 600 KB Output is correct
27 Correct 14 ms 344 KB Output is correct
28 Correct 7 ms 344 KB Output is correct
29 Correct 13 ms 604 KB Output is correct
30 Correct 16 ms 344 KB Output is correct
31 Correct 14 ms 448 KB Output is correct
32 Correct 13 ms 448 KB Output is correct
33 Correct 11 ms 608 KB Output is correct
34 Correct 13 ms 704 KB Output is correct
35 Correct 6 ms 452 KB Output is correct
36 Correct 10 ms 344 KB Output is correct
37 Correct 14 ms 600 KB Output is correct
38 Correct 13 ms 452 KB Output is correct
39 Correct 13 ms 700 KB Output is correct
40 Correct 8 ms 444 KB Output is correct
41 Correct 6 ms 448 KB Output is correct

Subtask #3
74.85 / 75.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 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 27 ms 456 KB Output is correct
8 Correct 12 ms 344 KB Output is correct
9 Correct 30 ms 452 KB Output is correct
10 Correct 35 ms 452 KB Output is correct
11 Correct 35 ms 848 KB Output is correct
12 Correct 14 ms 344 KB Output is correct
13 Correct 35 ms 448 KB Output is correct
14 Correct 25 ms 456 KB Output is correct
15 Correct 18 ms 464 KB Output is correct
16 Correct 23 ms 848 KB Output is correct
17 Correct 23 ms 600 KB Output is correct
18 Correct 22 ms 848 KB Output is correct
19 Correct 18 ms 456 KB Output is correct
20 Correct 16 ms 452 KB Output is correct
21 Correct 41 ms 452 KB Output is correct
22 Correct 31 ms 600 KB Output is correct
23 Correct 39 ms 700 KB Output is correct
24 Correct 19 ms 592 KB Output is correct
25 Correct 11 ms 344 KB Output is correct
26 Correct 8 ms 600 KB Output is correct
27 Correct 31 ms 856 KB Output is correct
28 Correct 27 ms 592 KB Output is correct
29 Correct 18 ms 456 KB Output is correct
30 Correct 23 ms 600 KB Output is correct
31 Correct 34 ms 592 KB Output is correct
32 Correct 22 ms 340 KB Output is correct
33 Partially correct 36 ms 608 KB Output is partially correct
34 Partially correct 43 ms 600 KB Output is partially correct
35 Correct 19 ms 700 KB Output is correct
36 Correct 18 ms 444 KB Output is correct
37 Correct 16 ms 344 KB Output is correct
38 Correct 21 ms 468 KB Output is correct
39 Correct 24 ms 448 KB Output is correct
40 Correct 30 ms 692 KB Output is correct
41 Correct 20 ms 956 KB Output is correct
42 Correct 17 ms 600 KB Output is correct
43 Correct 5 ms 344 KB Output is correct
44 Correct 23 ms 452 KB Output is correct
45 Correct 23 ms 608 KB Output is correct
46 Correct 7 ms 692 KB Output is correct
47 Correct 11 ms 596 KB Output is correct
48 Correct 6 ms 452 KB Output is correct