Submission #1058246

#	Time	Username	Problem	Language	Result	Execution time	Memory
1058246		dozer	드문 곤충 (IOI22_insects)	C++17	53.20 / 100	110 ms	1184 KiB

insects

#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 (stderr)

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 / 10
• Subtask 2: 15 / 15
• Subtask 3: 28.2 / 75