oj.uz

Submission #1057954

# Submission time Handle Problem Language Result Execution time Memory
1057954 2024-08-14T07:36:14 Z SalihSahin Rarest Insects (IOI22_insects) C++17
57.14 / 100
 98 ms 932 KB 
#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){
       int l = 1, r = N/colcnt;
       while(l <= r){
           int m = (l + r)/2;

           int tot = 0;
           for(int i = 0; i < N; i++){
              move_inside(i);
              tot++;
              int val = press_button();
              if(val > m){
                move_outside(i);
                tot--;
              }
              else cik.pb(i);
           }
           for(auto itr: cik) move_outside(itr);
           cik.clear();

           if(tot == colcnt * m) l = m + 1;
           else r = m - 1;
       }

       return r;
   }
   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.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 9 ms 344 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 4 ms 432 KB Output is correct
9 Correct 4 ms 344 KB Output is correct
10 Correct 8 ms 344 KB Output is correct
11 Correct 2 ms 344 KB Output is correct
12 Correct 4 ms 344 KB Output is correct
13 Correct 4 ms 344 KB Output is correct
14 Correct 7 ms 432 KB Output is correct
15 Correct 6 ms 344 KB Output is correct
16 Correct 4 ms 344 KB Output is correct
17 Correct 3 ms 436 KB Output is correct
18 Correct 4 ms 344 KB Output is correct
19 Correct 2 ms 344 KB Output is correct
20 Correct 3 ms 344 KB Output is correct
21 Correct 2 ms 344 KB Output is correct
22 Correct 2 ms 344 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 9 ms 344 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 4 ms 432 KB Output is correct
9 Correct 4 ms 344 KB Output is correct
10 Correct 8 ms 344 KB Output is correct
11 Correct 2 ms 344 KB Output is correct
12 Correct 4 ms 344 KB Output is correct
13 Correct 4 ms 344 KB Output is correct
14 Correct 7 ms 432 KB Output is correct
15 Correct 6 ms 344 KB Output is correct
16 Correct 4 ms 344 KB Output is correct
17 Correct 3 ms 436 KB Output is correct
18 Correct 4 ms 344 KB Output is correct
19 Correct 2 ms 344 KB Output is correct
20 Correct 3 ms 344 KB Output is correct
21 Correct 2 ms 344 KB Output is correct
22 Correct 2 ms 344 KB Output is correct
23 Correct 7 ms 344 KB Output is correct
24 Correct 9 ms 344 KB Output is correct
25 Correct 31 ms 600 KB Output is correct
26 Correct 25 ms 444 KB Output is correct
27 Correct 7 ms 344 KB Output is correct
28 Correct 8 ms 344 KB Output is correct
29 Correct 35 ms 436 KB Output is correct
30 Correct 38 ms 344 KB Output is correct
31 Correct 43 ms 440 KB Output is correct
32 Correct 36 ms 344 KB Output is correct
33 Correct 38 ms 440 KB Output is correct
34 Correct 33 ms 344 KB Output is correct
35 Correct 25 ms 592 KB Output is correct
36 Correct 28 ms 344 KB Output is correct
37 Correct 13 ms 344 KB Output is correct
38 Correct 22 ms 344 KB Output is correct
39 Correct 18 ms 440 KB Output is correct
40 Correct 14 ms 440 KB Output is correct
41 Correct 8 ms 344 KB Output is correct

Subtask #3
32.14 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Partially correct 0 ms 344 KB Output is partially correct
7 Correct 19 ms 440 KB Output is correct
8 Correct 16 ms 600 KB Output is correct
9 Partially correct 58 ms 676 KB Output is partially correct
10 Partially correct 48 ms 932 KB Output is partially correct
11 Correct 19 ms 428 KB Output is correct
12 Correct 16 ms 344 KB Output is correct
13 Partially correct 27 ms 688 KB Output is partially correct
14 Partially correct 42 ms 344 KB Output is partially correct
15 Partially correct 22 ms 344 KB Output is partially correct
16 Partially correct 98 ms 448 KB Output is partially correct
17 Partially correct 83 ms 440 KB Output is partially correct
18 Partially correct 57 ms 912 KB Output is partially correct
19 Partially correct 91 ms 680 KB Output is partially correct
20 Partially correct 62 ms 424 KB Output is partially correct
21 Partially correct 49 ms 856 KB Output is partially correct
22 Partially correct 55 ms 344 KB Output is partially correct
23 Partially correct 43 ms 444 KB Output is partially correct
24 Correct 24 ms 592 KB Output is correct
25 Correct 22 ms 592 KB Output is correct
26 Correct 19 ms 588 KB Output is correct
27 Partially correct 72 ms 848 KB Output is partially correct
28 Partially correct 55 ms 432 KB Output is partially correct
29 Partially correct 73 ms 696 KB Output is partially correct
30 Partially correct 60 ms 432 KB Output is partially correct
31 Partially correct 55 ms 676 KB Output is partially correct
32 Partially correct 56 ms 920 KB Output is partially correct
33 Partially correct 44 ms 344 KB Output is partially correct
34 Partially correct 51 ms 600 KB Output is partially correct
35 Partially correct 75 ms 660 KB Output is partially correct
36 Partially correct 83 ms 848 KB Output is partially correct
37 Partially correct 56 ms 428 KB Output is partially correct
38 Partially correct 57 ms 600 KB Output is partially correct
39 Partially correct 48 ms 920 KB Output is partially correct
40 Partially correct 44 ms 848 KB Output is partially correct
41 Partially correct 60 ms 668 KB Output is partially correct
42 Partially correct 57 ms 592 KB Output is partially correct
43 Partially correct 15 ms 344 KB Output is partially correct
44 Correct 15 ms 344 KB Output is correct
45 Correct 27 ms 440 KB Output is correct
46 Correct 25 ms 444 KB Output is correct
47 Correct 27 ms 344 KB Output is correct
48 Correct 24 ms 428 KB Output is correct