oj.uz

답안 #1029083

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1029083 2024-07-20T12:11:02 Z 42kangaroo 드문 곤충 (IOI22_insects) C++17
0 / 100
 15 ms 724 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) break;
			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) break;
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~
insects.cpp:34:49: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   34 |   if ((inside.size() + nIn.size() + aIn.size()) == m * k) {
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~

Subtask #1
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 1 ms 344 KB Output is correct
6 Incorrect 1 ms 344 KB Wrong answer.
7 Halted 0 ms 0 KB -

Subtask #2
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 1 ms 344 KB Output is correct
6 Incorrect 1 ms 344 KB Wrong answer.
7 Halted 0 ms 0 KB -

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 1 ms 344 KB Output is correct
7 Incorrect 15 ms 724 KB Wrong answer.
8 Halted 0 ms 0 KB -