Submission #652137

#	Time	Username	Problem	Language	Result	Execution time	Memory
652137		dXqwq	Rarest Insects (IOI22_insects)	C++17	100 / 100	69 ms	304 KiB

insects

#include<bits/stdc++.h>
#ifdef local
void move_inside(int i);
void move_outside(int i);
int press_button();
int min_cardinality(int N);
#else
#include"insects.h"
#endif
using namespace std;
bool vis[2003],flg[2003],fix[2003];
int d,cnt;
void clear(int n)
{
	for(int i=0; i<n; ++i)
		if(vis[i]&&!fix[i])
			vis[i]=0,--cnt,move_outside(i);
	return ;
}
int min_cardinality(int n)
{
	for(int i=0; i<n; ++i)
	{
		vis[i]=1,++cnt,move_inside(i);
		if(press_button()>1)
			vis[i]=0,--cnt,move_outside(i);
		else ++d;
	}
	int l=2,r=n/d,res=1,lst=1;
	memset(flg,1,sizeof(flg));
	while(l<=r)
	{
		int mid=(l+r+rand()%2)>>1;
		if(mid<lst)
		{
			for(int i=0; i<n; ++i) flg[i]&=vis[i];
			clear(n);
		}
		else
		{
			for(int i=0; i<n; ++i) fix[i]|=vis[i];
		}
		for(int i=0; i<n; ++i) if(!vis[i]&&flg[i])
		{
			vis[i]=1,++cnt,move_inside(i);
			if(press_button()>mid)
				vis[i]=0,--cnt,move_outside(i);
			if(cnt==d*mid) break;
		}
		if(cnt==d*mid) res=mid,l=mid+1;
		else r=mid-1;
		lst=mid;
	}
	return res;
}
#ifdef local
#include <cassert>
#include <cstdio>

#include <algorithm>
#include <map>
#include <set>
#include <string>
#include <vector>

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() {
  assert(1 == scanf("%d", &N));
  color.resize(N);
  in_box.assign(N, false);

  std::map<int, int> type_to_color;
  map<int,int> mp;
  for (int i = 0; i < N; ++i) {
    int Ti;
    assert(1 == scanf("%d", &Ti));
    ++mp[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];
  }
  int std=N;
  for(auto i:mp) std=min(std,i.second);
  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 %d\n", answer,std);
  printf("%d\n", Q);
  return 0;
}
#endif

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