oj.uz

답안 #1058246

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1058246 2024-08-14T09:05:37 Z dozer 드문 곤충 (IOI22_insects) C++17
53.2 / 100
 110 ms 1184 KB 
#include "insects.h"
#include <bits/stdc++.h>
using namespace std;
#define sp " "
#define endl "\n"
#define pii pair<int, int>
#define st first
#define nd second
#define fileio() freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout)
#define fastio() cin.tie(0), ios_base::sync_with_stdio(0)
#define pb push_back
#define LL node * 2
#define RR node * 2 + 1
#define ll long long
#define LOGN 12

const int modulo = 1e9 + 7;
const ll INF = 2e18 + 7;


int min_cardinality(int N) {
	int n = N;
	vector<int> roots;
	vector<int> done(n, 0);
	int m;

	auto check = [&](int x){
		vector<int> curr;
		for (int i = 0; i < n; i++){
			if (done[i]) continue;
			move_inside(i);
			if (press_button() <= x) curr.pb(i);
			else move_outside(i);
		}

		for (auto i : curr) move_outside(i);
		if (curr.size() == m * (x - 1)) return true;
		return false;
	};

	roots.pb(0);
	move_inside(0);
	done[0] = 1;
	for (int i = 1; i < n; i++){
		move_inside(i);
		if (press_button() != 1) move_outside(i);
		else{
			roots.pb(i);
			done[i] = 1;
		}
	}

	m = roots.size();
	if (m == 2){
		for (int i = 1; i < N; i++)
			if (done[i] == 0) move_inside(i);
		
		return N - press_button();
	}

	if (m * 2 > N) return 1;

	int ans = 0;
	for (int i = LOGN; i >= 0; i--){
		int tmp = ans + (1<<i);
		if (tmp * m <= N && check(tmp)) ans = tmp;
	}
	return ans;
}
/*
static inline constexpr int kMaxQueries = 40000;

static int N;
// Insect types are compressed to colors in the range [0, N).
static std::vector<int> color;
static std::vector<bool> in_box;

static std::vector<int> color_occurrences;
static std::multiset<int> max_occurrences;

static std::vector<int> op_counter(3, 0);

static inline void protocol_violation(std::string message) {
  printf("Protocol Violation: %s\n", message.c_str());
  exit(0);
}

void move_inside(int i) {
  if (i < 0 || i >= N) {
	protocol_violation("invalid parameter");
  }
  ++op_counter[0];
  if (op_counter[0] > kMaxQueries) {
	protocol_violation("too many calls");
  }
  if (!in_box[i]) {
	in_box[i] = true;
	max_occurrences.erase(max_occurrences.find(color_occurrences[color[i]]));
	++color_occurrences[color[i]];
	max_occurrences.insert(color_occurrences[color[i]]);
  }
}

void move_outside(int i) {
  if (i < 0 || i >= N) {
	protocol_violation("invalid parameter");
  }
  ++op_counter[1];
  if (op_counter[1] > kMaxQueries) {
	protocol_violation("too many calls");
  }
  if (in_box[i]) {
	in_box[i] = false;
	max_occurrences.erase(max_occurrences.find(color_occurrences[color[i]]));
	--color_occurrences[color[i]];
	max_occurrences.insert(color_occurrences[color[i]]);
  }
}

int press_button() {
  ++op_counter[2];
  if (op_counter[2] > kMaxQueries) {
	protocol_violation("too many calls");
  }
  return *(max_occurrences.rbegin());
}

int main() {
	fileio();
  assert(1 == scanf("%d", &N));
  color.resize(N);
  in_box.assign(N, false);

  std::map<int, int> type_to_color;
  for (int i = 0; i < N; ++i) {
	int Ti;
	assert(1 == scanf("%d", &Ti));
	if (type_to_color.find(Ti) == type_to_color.end()) {
	  int new_color = type_to_color.size();
	  type_to_color[Ti] = new_color;
	  max_occurrences.insert(0);
	}
	color[i] = type_to_color[Ti];
  }

  color_occurrences.assign(type_to_color.size(), 0);

  int answer = min_cardinality(N);
  int Q = *std::max_element(op_counter.begin(), op_counter.end());
  printf("%d\n", answer);
  printf("%d\n", Q);
  return 0;
}
*/

Compilation message

insects.cpp: In lambda function:
insects.cpp:37:19: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   37 |   if (curr.size() == m * (x - 1)) return true;
      |       ~~~~~~~~~~~~^~~~~~~~~~~~~~

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 5 ms 436 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 5 ms 356 KB Output is correct
9 Correct 3 ms 344 KB Output is correct
10 Correct 1 ms 344 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 344 KB Output is correct
14 Correct 6 ms 600 KB Output is correct
15 Correct 6 ms 344 KB Output is correct
16 Correct 4 ms 432 KB Output is correct
17 Correct 4 ms 344 KB Output is correct
18 Correct 2 ms 344 KB Output is correct
19 Correct 5 ms 436 KB Output is correct
20 Correct 4 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 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 5 ms 436 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 5 ms 356 KB Output is correct
9 Correct 3 ms 344 KB Output is correct
10 Correct 1 ms 344 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 344 KB Output is correct
14 Correct 6 ms 600 KB Output is correct
15 Correct 6 ms 344 KB Output is correct
16 Correct 4 ms 432 KB Output is correct
17 Correct 4 ms 344 KB Output is correct
18 Correct 2 ms 344 KB Output is correct
19 Correct 5 ms 436 KB Output is correct
20 Correct 4 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 37 ms 448 KB Output is correct
24 Correct 4 ms 344 KB Output is correct
25 Correct 8 ms 440 KB Output is correct
26 Correct 36 ms 424 KB Output is correct
27 Correct 4 ms 344 KB Output is correct
28 Correct 5 ms 344 KB Output is correct
29 Correct 36 ms 436 KB Output is correct
30 Correct 29 ms 344 KB Output is correct
31 Correct 38 ms 444 KB Output is correct
32 Correct 26 ms 440 KB Output is correct
33 Correct 39 ms 600 KB Output is correct
34 Correct 33 ms 600 KB Output is correct
35 Correct 30 ms 344 KB Output is correct
36 Correct 27 ms 344 KB Output is correct
37 Correct 32 ms 600 KB Output is correct
38 Correct 19 ms 444 KB Output is correct
39 Correct 12 ms 344 KB Output is correct
40 Correct 10 ms 444 KB Output is correct
41 Correct 4 ms 444 KB Output is correct

Subtask #3
28.2 / 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 Partially correct 47 ms 444 KB Output is partially correct
8 Correct 11 ms 344 KB Output is correct
9 Partially correct 52 ms 432 KB Output is partially correct
10 Partially correct 74 ms 704 KB Output is partially correct
11 Correct 8 ms 448 KB Output is correct
12 Correct 9 ms 344 KB Output is correct
13 Partially correct 110 ms 448 KB Output is partially correct
14 Partially correct 68 ms 448 KB Output is partially correct
15 Partially correct 95 ms 596 KB Output is partially correct
16 Partially correct 85 ms 676 KB Output is partially correct
17 Partially correct 80 ms 820 KB Output is partially correct
18 Partially correct 68 ms 440 KB Output is partially correct
19 Partially correct 75 ms 692 KB Output is partially correct
20 Partially correct 73 ms 1184 KB Output is partially correct
21 Partially correct 68 ms 672 KB Output is partially correct
22 Partially correct 51 ms 592 KB Output is partially correct
23 Partially correct 37 ms 452 KB Output is partially correct
24 Partially correct 30 ms 344 KB Output is partially correct
25 Correct 17 ms 428 KB Output is correct
26 Correct 7 ms 452 KB Output is correct
27 Correct 19 ms 684 KB Output is correct
28 Correct 11 ms 344 KB Output is correct
29 Correct 34 ms 688 KB Output is correct
30 Correct 25 ms 592 KB Output is correct
31 Partially correct 56 ms 444 KB Output is partially correct
32 Partially correct 65 ms 592 KB Output is partially correct
33 Partially correct 43 ms 440 KB Output is partially correct
34 Partially correct 48 ms 600 KB Output is partially correct
35 Correct 28 ms 700 KB Output is correct
36 Correct 22 ms 680 KB Output is correct
37 Partially correct 71 ms 688 KB Output is partially correct
38 Partially correct 66 ms 436 KB Output is partially correct
39 Correct 15 ms 444 KB Output is correct
40 Correct 21 ms 676 KB Output is correct
41 Correct 28 ms 592 KB Output is correct
42 Correct 23 ms 600 KB Output is correct
43 Partially correct 13 ms 344 KB Output is partially correct
44 Partially correct 75 ms 440 KB Output is partially correct
45 Correct 7 ms 420 KB Output is correct
46 Correct 15 ms 344 KB Output is correct
47 Correct 13 ms 344 KB Output is correct
48 Correct 15 ms 440 KB Output is correct