oj.uz

Submission #922873

# Submission time Handle Problem Language Result Execution time Memory
922873 2024-02-06T08:33:51 Z Ludissey Rarest Insects (IOI22_insects) C++17
10 / 100
 27 ms 1112 KB 
#include "insects.h"
#include <bits/stdc++.h>

using namespace std;

struct insect {
  int i,sz;
};
vector<insect> types;

int min_cardinality(int N) {
  types.push_back(insect{0, 1});
  move_inside(0);
  vector<bool> skip(N);
  int boxSz=1;
  for (int i = 1; i < N; i++)
  {
    move_inside(i);
    if(press_button()==1){
      types.push_back(insect{i, 1});
      boxSz++;
    } else{
      int l=0, r=boxSz-1;
      while(r-l>0){
        int mid=(l+r)/2;
        for (int j = mid+1; j <= r; j++) move_outside(types[j].i);
        if(press_button()>1){
          r=mid;
        }else{
          l=mid+1;
          for (int j = mid+1; j <= r; j++) move_inside(types[j].i);
          for (int j = l; j <= mid; j++) move_outside(types[j].i);
        }
      } 
      types[l].sz++;
      move_outside(l);
      move_outside(i);
      for (int j = 0; j < (int)types.size(); j++) move_inside(types[j].i);
    }
  }
  int mn=1e9;
  for (int j = 0; j < (int)types.size(); j++) mn=min(mn,types[j].sz);
  return mn;
}

Subtask #1
10.0 / 10.0

# 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 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 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 6 ms 344 KB Output is correct
9 Correct 4 ms 344 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 5 ms 596 KB Output is correct
12 Correct 3 ms 344 KB Output is correct
13 Correct 4 ms 344 KB Output is correct
14 Correct 3 ms 344 KB Output is correct
15 Correct 3 ms 344 KB Output is correct
16 Correct 4 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 5 ms 344 KB Output is correct
20 Correct 6 ms 344 KB Output is correct
21 Correct 6 ms 344 KB Output is correct
22 Correct 5 ms 344 KB Output is correct

Subtask #2
0 / 15.0

# 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 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 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 6 ms 344 KB Output is correct
9 Correct 4 ms 344 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 5 ms 596 KB Output is correct
12 Correct 3 ms 344 KB Output is correct
13 Correct 4 ms 344 KB Output is correct
14 Correct 3 ms 344 KB Output is correct
15 Correct 3 ms 344 KB Output is correct
16 Correct 4 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 5 ms 344 KB Output is correct
20 Correct 6 ms 344 KB Output is correct
21 Correct 6 ms 344 KB Output is correct
22 Correct 5 ms 344 KB Output is correct
23 Correct 5 ms 344 KB Output is correct
24 Correct 4 ms 600 KB Output is correct
25 Incorrect 27 ms 344 KB Too many queries.
26 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 1 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 1 ms 344 KB Output is correct
7 Correct 15 ms 344 KB Output is correct
8 Correct 10 ms 1112 KB Output is correct
9 Incorrect 22 ms 344 KB Too many queries.
10 Halted 0 ms 0 KB -