oj.uz

답안 #1029136

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1029136 2024-07-20T12:54:30 Z 42kangaroo 드문 곤충 (IOI22_insects) C++17
25 / 100
 39 ms 860 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 < 350) 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 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 3 ms 440 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 2 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 3 ms 344 KB Output is correct
13 Correct 3 ms 344 KB Output is correct
14 Correct 2 ms 344 KB Output is correct
15 Correct 3 ms 440 KB Output is correct
16 Correct 2 ms 344 KB Output is correct
17 Correct 3 ms 344 KB Output is correct
18 Correct 3 ms 436 KB Output is correct
19 Correct 3 ms 344 KB Output is correct
20 Correct 2 ms 344 KB Output is correct
21 Correct 2 ms 344 KB Output is correct
22 Correct 3 ms 436 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 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 3 ms 440 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 2 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 3 ms 344 KB Output is correct
13 Correct 3 ms 344 KB Output is correct
14 Correct 2 ms 344 KB Output is correct
15 Correct 3 ms 440 KB Output is correct
16 Correct 2 ms 344 KB Output is correct
17 Correct 3 ms 344 KB Output is correct
18 Correct 3 ms 436 KB Output is correct
19 Correct 3 ms 344 KB Output is correct
20 Correct 2 ms 344 KB Output is correct
21 Correct 2 ms 344 KB Output is correct
22 Correct 3 ms 436 KB Output is correct
23 Correct 12 ms 444 KB Output is correct
24 Correct 5 ms 344 KB Output is correct
25 Correct 15 ms 448 KB Output is correct
26 Correct 11 ms 344 KB Output is correct
27 Correct 11 ms 344 KB Output is correct
28 Correct 6 ms 444 KB Output is correct
29 Correct 15 ms 452 KB Output is correct
30 Correct 17 ms 344 KB Output is correct
31 Correct 9 ms 600 KB Output is correct
32 Correct 9 ms 448 KB Output is correct
33 Correct 18 ms 344 KB Output is correct
34 Correct 7 ms 344 KB Output is correct
35 Correct 8 ms 344 KB Output is correct
36 Correct 11 ms 600 KB Output is correct
37 Correct 17 ms 448 KB Output is correct
38 Correct 11 ms 344 KB Output is correct
39 Correct 13 ms 600 KB Output is correct
40 Correct 7 ms 344 KB Output is correct
41 Correct 7 ms 448 KB Output is correct

Subtask #3
0 / 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 17 ms 456 KB Output is correct
8 Correct 12 ms 344 KB Output is correct
9 Correct 25 ms 344 KB Output is correct
10 Correct 31 ms 592 KB Output is correct
11 Correct 18 ms 444 KB Output is correct
12 Correct 10 ms 600 KB Output is correct
13 Correct 21 ms 344 KB Output is correct
14 Correct 27 ms 700 KB Output is correct
15 Correct 20 ms 344 KB Output is correct
16 Correct 36 ms 448 KB Output is correct
17 Correct 29 ms 600 KB Output is correct
18 Correct 23 ms 592 KB Output is correct
19 Correct 23 ms 592 KB Output is correct
20 Correct 23 ms 436 KB Output is correct
21 Correct 28 ms 680 KB Output is correct
22 Correct 31 ms 344 KB Output is correct
23 Correct 31 ms 696 KB Output is correct
24 Correct 18 ms 600 KB Output is correct
25 Correct 20 ms 592 KB Output is correct
26 Correct 10 ms 344 KB Output is correct
27 Correct 27 ms 600 KB Output is correct
28 Correct 27 ms 860 KB Output is correct
29 Correct 34 ms 340 KB Output is correct
30 Correct 33 ms 852 KB Output is correct
31 Correct 38 ms 696 KB Output is correct
32 Correct 39 ms 456 KB Output is correct
33 Incorrect 29 ms 456 KB Wrong answer.
34 Halted 0 ms 0 KB -