Submission #1074801

# Submission time Handle Problem Language Result Execution time Memory
1074801 2024-08-25T14:11:59 Z fv3 Rarest Insects (IOI22_insects) C++17
43.3 / 100
163 ms 712 KB
#include "insects.h"
#include <bits/stdc++.h>
 
using namespace std;
 
int min_cardinality(int N) 
{
  // Find the number of different insect types:
  // Maximum number of insects with 1 being maximum
  // Let that number be K
  // Find another set of K numbers with 2 being the maximum
  // Then 3 and 4 and so on untill it is no longer possible
 
  // The grader is not adaptive:
  vector<int> indicies(N);
  iota(indicies.begin(), indicies.end(), 0);
 
  mt19937 mt(time(0));
  shuffle(indicies.begin(), indicies.end(), mt);
 
  vector<int> in(N);
  vector<int> order;

  int k = 0;
  int insect_cnt = 0;
  for (int i = 0; i < N; i++)
  {
    move_inside(indicies[i]);
    if (press_button() > 1)
    {
      move_outside(indicies[i]);
    }
    else
    {
      k++;
      insect_cnt++;
      order.push_back(i);
      in[i] = 1;
    }
  }

  if (k < sqrt(N))
  {
    int res = 1;
    while (true)
    {
      int cnt = 0;
      for (int i = 0; i < N && cnt < k; i++)
      {
        if (in[i]) continue;
   
        move_inside(indicies[i]);
        if (press_button() > res + 1)
        {
          move_outside(indicies[i]);
        }
        else
        {
          cnt++;
          in[i] = 1;
        }
      }
   
      if (cnt < k)
        return res;
      res++;
    }
   
    return res;
  }

  int l = 1, r = N / k;
  while (l < r)
  {
    int c = (l + r + 1) / 2;
    while (insect_cnt > k * l)
    {
      move_outside(indicies[order.back()]);
      in[order.back()] = 0;
      order.pop_back();
      insect_cnt--;
    }

    for (int i = 0; i < N && insect_cnt < k * c; i++)
    {
      if (in[i]) continue;

      move_inside(indicies[i]);
      if (press_button() > c)
      {
        move_outside(indicies[i]);
      }
      else
      {
        insect_cnt++;
        order.push_back(i);
        in[i] = 1;
      }
    }
    
    if (insect_cnt >= k * c)
      l = c;
    else
      r = c - 1;
  }
 
  return l;
}
# 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 1 ms 344 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 4 ms 344 KB Output is correct
9 Correct 3 ms 344 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 3 ms 344 KB Output is correct
13 Correct 2 ms 344 KB Output is correct
14 Correct 8 ms 344 KB Output is correct
15 Correct 10 ms 344 KB Output is correct
16 Correct 5 ms 344 KB Output is correct
17 Correct 4 ms 344 KB Output is correct
18 Correct 4 ms 344 KB Output is correct
19 Correct 3 ms 344 KB Output is correct
20 Correct 2 ms 344 KB Output is correct
21 Correct 2 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
# 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 1 ms 344 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 4 ms 344 KB Output is correct
9 Correct 3 ms 344 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 3 ms 344 KB Output is correct
13 Correct 2 ms 344 KB Output is correct
14 Correct 8 ms 344 KB Output is correct
15 Correct 10 ms 344 KB Output is correct
16 Correct 5 ms 344 KB Output is correct
17 Correct 4 ms 344 KB Output is correct
18 Correct 4 ms 344 KB Output is correct
19 Correct 3 ms 344 KB Output is correct
20 Correct 2 ms 344 KB Output is correct
21 Correct 2 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 10 ms 344 KB Output is correct
24 Correct 6 ms 344 KB Output is correct
25 Correct 32 ms 344 KB Output is correct
26 Correct 33 ms 344 KB Output is correct
27 Correct 9 ms 344 KB Output is correct
28 Correct 5 ms 344 KB Output is correct
29 Correct 13 ms 344 KB Output is correct
30 Correct 9 ms 344 KB Output is correct
31 Correct 38 ms 344 KB Output is correct
32 Correct 51 ms 344 KB Output is correct
33 Correct 64 ms 344 KB Output is correct
34 Correct 47 ms 344 KB Output is correct
35 Correct 54 ms 344 KB Output is correct
36 Correct 46 ms 344 KB Output is correct
37 Correct 17 ms 448 KB Output is correct
38 Correct 22 ms 440 KB Output is correct
39 Correct 11 ms 600 KB Output is correct
40 Correct 7 ms 344 KB Output is correct
41 Correct 6 ms 444 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 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 Correct 0 ms 344 KB Output is correct
7 Correct 14 ms 344 KB Output is correct
8 Correct 12 ms 456 KB Output is correct
9 Partially correct 62 ms 344 KB Output is partially correct
10 Partially correct 126 ms 344 KB Output is partially correct
11 Correct 36 ms 344 KB Output is correct
12 Correct 16 ms 460 KB Output is correct
13 Correct 24 ms 344 KB Output is correct
14 Correct 18 ms 344 KB Output is correct
15 Partially correct 109 ms 344 KB Output is partially correct
16 Partially correct 137 ms 344 KB Output is partially correct
17 Partially correct 131 ms 344 KB Output is partially correct
18 Partially correct 163 ms 372 KB Output is partially correct
19 Partially correct 128 ms 344 KB Output is partially correct
20 Partially correct 144 ms 344 KB Output is partially correct
21 Partially correct 34 ms 688 KB Output is partially correct
22 Partially correct 36 ms 448 KB Output is partially correct
23 Partially correct 41 ms 444 KB Output is partially correct
24 Correct 38 ms 452 KB Output is correct
25 Correct 18 ms 344 KB Output is correct
26 Correct 10 ms 344 KB Output is correct
27 Correct 36 ms 432 KB Output is correct
28 Correct 22 ms 344 KB Output is correct
29 Partially correct 65 ms 344 KB Output is partially correct
30 Partially correct 89 ms 344 KB Output is partially correct
31 Partially correct 44 ms 344 KB Output is partially correct
32 Partially correct 49 ms 688 KB Output is partially correct
33 Partially correct 42 ms 688 KB Output is partially correct
34 Partially correct 58 ms 432 KB Output is partially correct
35 Correct 28 ms 432 KB Output is correct
36 Correct 28 ms 436 KB Output is correct
37 Partially correct 34 ms 448 KB Output is partially correct
38 Partially correct 31 ms 436 KB Output is partially correct
39 Correct 26 ms 452 KB Output is correct
40 Correct 27 ms 452 KB Output is correct
41 Correct 25 ms 440 KB Output is correct
42 Correct 24 ms 428 KB Output is correct
43 Correct 7 ms 344 KB Output is correct
44 Correct 23 ms 344 KB Output is correct
45 Partially correct 86 ms 344 KB Output is partially correct
46 Correct 16 ms 344 KB Output is correct
47 Correct 16 ms 456 KB Output is correct
48 Correct 16 ms 712 KB Output is correct