Submission #1233034

#	Time	Username	Problem	Language	Result	Execution time	Memory
1233034		santi3223	Rarest Insects (IOI22_insects)	C++20	47.50 / 100	60 ms	448 KiB

insects

#include <bits/stdc++.h>
#include "insects.h"
using namespace std;
#define ll long long
#define vb vector<bool>
#define pb push_back
#define ff(aa, bb, cc) for(ll aa = bb; aa < cc; aa++)
#define vl vector<ll>
#define pll pair<ll, ll>
#define fi first
#define se second
#define ed "\n"
#define all(aaa) aaa.begin(), aaa.end()
#define rall(aaa) aaa.rbegin(), aaa.rend()
ll MOD = 1e9+7;
 

/*
#include <cassert>
#include <cstdio>


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 min_cardinality(int n){
	ll dis = 0;
	vl al;
	ff(i, 0, n){
		move_inside(i);
		if(press_button() > 1){
			move_outside(i);
		}
		else{
			dis++;
			al.pb(i);
		}
	}
	//cout << "D " << dis << ed;
	ff(i, 0, al.size()){
		move_outside(al[i]);
	}
	ll l = 1, r = n/dis, ans = 1;
	//cout << "START " << l << " " << r << ed;
	while(l <= r){
		//cout << l << " " << r << " ";
		ll mid = l+(r-l)/2;
		vl cur;
		//cout << mid << ed;
		ll count = 0;
		ff(i, 0, n){
			move_inside(i);
			if(press_button() > mid){
				move_outside(i);
			}
			else{
				count++;
				cur.pb(i);
			}
		}
		//cout << "f " << count << " " << mid*dis << ed;
		//cout << "MID " << mid << " " << dis << ed;
		if(count>=mid*dis){
			ans = mid;
			l = mid+1;
		}
		else{
			r = mid-1;
		}
		ff(i, 0, cur.size()){
			move_outside(cur[i]);
		}
	}
	return ans;
}
/*
int main() {
  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;
}
*/

• Subtask 1: 10 / 10
• Subtask 2: 15 / 15
• Subtask 3: 22.5 / 75