oj.uz

답안 #1029090

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

using namespace std;

int min_cardinality(int N) {
	int nums = 0;
	set<int> inside, outside, aIn;
	for (int i = 0; i < N; ++i) {
		nums++;
		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 {
				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 k;
	return l;
}

Compilation message

insects.cpp: In function 'int min_cardinality(int)':
insects.cpp:29:50: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   29 |    if ((inside.size() + nIn.size() + aIn.size()) == m * k) {
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~
insects.cpp:40:49: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   40 |   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 1 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 1 ms 344 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Correct 4 ms 344 KB Output is correct
10 Correct 2 ms 452 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 5 ms 344 KB Output is correct
13 Correct 3 ms 440 KB Output is correct
14 Correct 2 ms 344 KB Output is correct
15 Correct 2 ms 344 KB Output is correct
16 Correct 2 ms 448 KB Output is correct
17 Correct 4 ms 344 KB Output is correct
18 Correct 3 ms 344 KB Output is correct
19 Correct 2 ms 600 KB Output is correct
20 Correct 3 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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 1 ms 344 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Correct 4 ms 344 KB Output is correct
10 Correct 2 ms 452 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 5 ms 344 KB Output is correct
13 Correct 3 ms 440 KB Output is correct
14 Correct 2 ms 344 KB Output is correct
15 Correct 2 ms 344 KB Output is correct
16 Correct 2 ms 448 KB Output is correct
17 Correct 4 ms 344 KB Output is correct
18 Correct 3 ms 344 KB Output is correct
19 Correct 2 ms 600 KB Output is correct
20 Correct 3 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 9 ms 344 KB Output is correct
24 Correct 4 ms 600 KB Output is correct
25 Correct 14 ms 484 KB Output is correct
26 Correct 10 ms 344 KB Output is correct
27 Correct 16 ms 636 KB Output is correct
28 Correct 5 ms 472 KB Output is correct
29 Correct 12 ms 488 KB Output is correct
30 Correct 19 ms 344 KB Output is correct
31 Correct 9 ms 476 KB Output is correct
32 Correct 9 ms 344 KB Output is correct
33 Correct 14 ms 976 KB Output is correct
34 Correct 7 ms 344 KB Output is correct
35 Correct 9 ms 600 KB Output is correct
36 Correct 16 ms 496 KB Output is correct
37 Correct 10 ms 448 KB Output is correct
38 Correct 13 ms 600 KB Output is correct
39 Correct 7 ms 344 KB Output is correct
40 Correct 9 ms 616 KB Output is correct
41 Correct 4 ms 344 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 15 ms 488 KB Output is correct
8 Correct 8 ms 344 KB Output is correct
9 Correct 17 ms 600 KB Output is correct
10 Correct 21 ms 792 KB Output is correct
11 Correct 13 ms 600 KB Output is correct
12 Correct 13 ms 344 KB Output is correct
13 Correct 21 ms 764 KB Output is correct
14 Correct 32 ms 600 KB Output is correct
15 Correct 16 ms 592 KB Output is correct
16 Correct 28 ms 752 KB Output is correct
17 Correct 19 ms 600 KB Output is correct
18 Correct 31 ms 1004 KB Output is correct
19 Correct 23 ms 756 KB Output is correct
20 Correct 16 ms 592 KB Output is correct
21 Correct 22 ms 344 KB Output is correct
22 Correct 24 ms 628 KB Output is correct
23 Correct 26 ms 600 KB Output is correct
24 Correct 23 ms 1280 KB Output is correct
25 Correct 16 ms 600 KB Output is correct
26 Correct 9 ms 600 KB Output is correct
27 Correct 26 ms 600 KB Output is correct
28 Correct 13 ms 728 KB Output is correct
29 Correct 29 ms 600 KB Output is correct
30 Correct 22 ms 600 KB Output is correct
31 Correct 23 ms 504 KB Output is correct
32 Correct 21 ms 472 KB Output is correct
33 Incorrect 39 ms 600 KB Wrong answer.
34 Halted 0 ms 0 KB -