제출 #1058414

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1058414		SalihSahin	드문 곤충 (IOI22_insects)	C++17	95.32 / 100	48 ms	848 KiB

insects

#include<bits/stdc++.h>
#include "insects.h"
#define pb push_back
using namespace std;
 
/*
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) {
   mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
   vector<int> cik;
 
   int colcnt = 0;
   for(int i = 0; i < N; i++){
      move_inside(i);
      colcnt++;
      int val = press_button();
      if(val == 2){
        move_outside(i);
        colcnt--;
      }
      else cik.pb(i);
   }
   for(auto itr: cik){
    move_outside(itr);
   }
   cik.clear();
 
   if(N/colcnt < 256){
       vector<int> rem, nrem;
       for(int i = 0; i < N; i++){
        rem.pb(i);
       }

       int bt = 0, x = 1;
       while(x * 2 <= N/colcnt){
        bt++;
        x *= 2;
       }

       int ans = 0;
       for(int i = bt; i >= 0; i--){
          int val = (1 << i);
          vector<int> out;

          int cnt = 0;

          for(auto it: rem){
             cnt++;
             move_inside(it);
             int check = press_button();
             if(check > ans + val){
                move_outside(it);
                out.pb(it);
                cnt--;
             }
             else nrem.pb(it);
          }

          if(cnt == colcnt * val){ 
             ans += val;
             rem = out;
          }
          else{
             for(auto itr: nrem) move_outside(itr);
              rem = nrem;
          }
          nrem.clear();
       }

       return ans;
   }
   else{
      vector<int> wh, nxtwh;
      for(int i = 0; i < N; i++){
          wh.pb(i);
      }
      shuffle(wh.begin(), wh.end(), rng);
 
      int sz = 0, ans = N;
 
      while(wh.size() > 0){
         sz = 0;
         for(auto itr: wh){
              move_inside(itr);
              sz++;
              int val = press_button();
              if(val != sz){
                move_outside(itr);
                nxtwh.pb(itr);
                sz--;
              }
              else cik.pb(itr);
          }
          ans = min(ans, sz);
          wh = nxtwh;
          for(auto itr: cik) move_outside(itr);
          cik.clear();
          nxtwh.clear();
      }
 
      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: 70.32 / 75