oj.uz

Submission #1074758

# Submission time Handle Problem Language Result Execution time Memory
1074758 2024-08-25T13:48:22 Z fv3 Rarest Insects (IOI22_insects) C++17
0 / 100
 44 ms 592 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;
    }
  }

  int l = 1, r = N / k;
  while (l < r)
  {
    int c = (l + r + 1) / 2;
    while (insect_cnt > k * c)
    {
      move_outside(indicies[order.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)
      r = c - 1;
    else
      l = c;
  }
 
  return l;
}

Subtask #1
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 1 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 2 ms 344 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Incorrect 3 ms 344 KB Wrong answer.
10 Halted 0 ms 0 KB -

Subtask #2
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 1 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 2 ms 344 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Incorrect 3 ms 344 KB Wrong answer.
10 Halted 0 ms 0 KB -

Subtask #3
0 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 344 KB Output is correct
7 Correct 17 ms 452 KB Output is correct
8 Correct 7 ms 344 KB Output is correct
9 Correct 44 ms 592 KB Output is correct
10 Incorrect 20 ms 344 KB Wrong answer.
11 Halted 0 ms 0 KB -