제출 #631737

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
631737		AmirElarbi	드문 곤충 (IOI22_insects)	C++17	컴파일 에러	0 ms	0 KiB

insects

//#include "insects.h"
#include <bits/stdc++.h>
#define ve vector
#define vi ve<int>
#define ii pair<int,int>
#define ll long long
#define vvi ve<vi>
#define se second
#define fi first

using namespace std;
const int nax = 2e3+5;
const int MOD = 1e9+7;

static 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 pref[nax];
int min_cardinality(int n) {
  int type  = 0;
  for (int i = 0; i < n; ++i)
  {
       move_inside(i);
       int a = press_button();
       if(a == 1)
        type++;
       else 
        move_outside(i);
      pref[i] = type;
  }
  for (int i = 0; i < n; ++i)
  {
    move_outside(i);
  }
  int l = 0,r = n, ans = 0;
  while(l< r){
    int md = (l+r)/2;
    int nb = 0;
    for (int i = 0; i < n; ++i)
    {
      move_inside(i);
      int a = press_button();
      if(a  > md){
        move_outside(i);
      } else nb++;
    }
    if(type*md == nb){
      l = md+1; ans = md; 
    } else {
      r = md;
    }
    for (int i = 0; i < n; ++i)
    {
      move_outside(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;
}

컴파일 시 표준 에러 (stderr) 메시지

/usr/bin/ld: /tmp/ccsGHlTN.o: in function `move_inside(int)':
stub.cpp:(.text+0x0): multiple definition of `move_inside(int)'; /tmp/ccxwEz4P.o:insects.cpp:(.text+0x290): first defined here
/usr/bin/ld: /tmp/ccsGHlTN.o: in function `move_outside(int)':
stub.cpp:(.text+0xe0): multiple definition of `move_outside(int)'; /tmp/ccxwEz4P.o:insects.cpp:(.text+0x460): first defined here
/usr/bin/ld: /tmp/ccsGHlTN.o: in function `press_button()':
stub.cpp:(.text+0x1c0): multiple definition of `press_button()'; /tmp/ccxwEz4P.o:insects.cpp:(.text+0x200): first defined here
/usr/bin/ld: /tmp/ccsGHlTN.o: in function `main':
stub.cpp:(.text.startup+0x0): multiple definition of `main'; /tmp/ccxwEz4P.o:insects.cpp:(.text.startup+0x0): first defined here
collect2: error: ld returned 1 exit status