oj.uz

Submission #1058293

# Submission time Handle Problem Language Result Execution time Memory
1058293 2024-08-14T09:15:17 Z aykhn Rarest Insects (IOI22_insects) C++17
0 / 100
 38 ms 692 KB 
#include "insects.h"
#include <bits/stdc++.h>

using namespace std;

int min_cardinality(int N) 
{
  int uni = 0;
  vector<int> v;
  for (int i = 0; i < N; i++)
  {
    move_inside(i);
    if (press_button() > 1) move_outside(i);
    else uni++, v.push_back(i);
  }
  for (int &i : v) move_outside(i);
  v.clear();
  vector<int> in(N, 0);
  vector<int> alive(N, 1);
  int l = 1, r = N / uni;
  while (l < r)
  {
    int mid = (l + r + 1) >> 1;
    for (int i = 0; i < N; i++)
    {
      if (!alive[i]) continue;
      if (in[i]) continue;
      move_inside(i);
      v.push_back(i);
      in[i] = 1;
      if (press_button() > mid) 
      {
        in[i] = 0;
        move_outside(i);
        v.pop_back();
      }
    }
    if ((int)v.size() != mid * uni)
    {
      for (int i = 0; i < N; i++)
      {
        if (!in[i]) alive[i] = 0;
        in[i] = 0;
      }
      for (int &i : v) move_outside(i);
      v.clear();
      r = mid - 1;
    }
    else
    {
      for (int i = 0; i < N; i++)
      {
        if (in[i]) alive[i] = 0;
      }
      l = mid;
    }
  }
  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 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 Correct 2 ms 344 KB Output is correct
7 Correct 1 ms 432 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Correct 5 ms 344 KB Output is correct
10 Correct 1 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 3 ms 432 KB Output is correct
14 Incorrect 2 ms 344 KB Wrong answer.
15 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 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 Correct 2 ms 344 KB Output is correct
7 Correct 1 ms 432 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Correct 5 ms 344 KB Output is correct
10 Correct 1 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 3 ms 432 KB Output is correct
14 Incorrect 2 ms 344 KB Wrong answer.
15 Halted 0 ms 0 KB -

Subtask #3
0 / 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 Correct 0 ms 344 KB Output is correct
7 Correct 26 ms 436 KB Output is correct
8 Correct 8 ms 600 KB Output is correct
9 Correct 26 ms 436 KB Output is correct
10 Partially correct 23 ms 684 KB Output is partially correct
11 Correct 13 ms 344 KB Output is correct
12 Correct 17 ms 692 KB Output is correct
13 Correct 38 ms 436 KB Output is correct
14 Correct 33 ms 424 KB Output is correct
15 Incorrect 30 ms 444 KB Wrong answer.
16 Halted 0 ms 0 KB -