Submission #1009171

# Submission time Handle Problem Language Result Execution time Memory
1009171 2024-06-27T09:33:44 Z oyber Rarest Insects (IOI22_insects) C++17
39.06 / 100
214 ms 1108 KB
#include "insects.h"
#include <bits/stdc++.h>
using namespace std;

vector<int> uniqu;
vector<int> insects;
int N;
vector<bool> used;

void empty() {
  for (int i = 0; i < N; i++) {
    if (used[i]) {
      move_outside(i);
      used[i] = false;
    }
  }
}

bool check_num(int num) {
  //printf("num: %d\n", num);
  for (int i = 0; i < int(insects.size()); i++) {
    if (used[insects[i]]) continue;
    //printf("insect: %d\n", insects[i]);
    move_inside(insects[i]);
    if (press_button() >= num) {
      move_outside(insects[i]);
      continue;
    }
    used[insects[i]] = true;
  }

  //printf("n1: %d\n", press_button());
  bool valid = true;
  for (int i = 0; i < int(uniqu.size()); i++) {
    //printf("n2: %d\n", press_button());
    move_inside(uniqu[i]);
    //printf("n3: %d\n", press_button());
    if (press_button() != num) {
      //printf("not valid i=%d\n", uniqu[i]);
      move_outside(uniqu[i]);
      valid = false;
      break;
    }
    move_outside(uniqu[i]);
  }
  empty();

  //printf("valid: %d\n", int(valid));
  return valid;
}

int min_cardinality(int n) {
  N = n;
  used.resize(N);
  int types = 0;
  for (int i = 0; i < N; i++) {
    move_inside(i);
    if (press_button() > 1) {
      move_outside(i);
      insects.push_back(i);
      continue;
    }
    types++;
    uniqu.push_back(i);
  }

  for (int i = 0; i < int(uniqu.size()); i++) {
    move_outside(uniqu[i]);
  }


  int l = 1;
  int r = N/types+1;
  while (l < r) {
    int m = (l*2+r)/3;
    if (check_num(m)) {
      l = m+1;
    } else {
      r = m;
    }
  }
  return r-1;

  /*for (int i = 1; i <= N/types; i++) {
    if (!check_num(i)) {
      return i-1;
    }
  }
  return N/types;*/
}
# 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 14 ms 344 KB Output is correct
7 Correct 3 ms 344 KB Output is correct
8 Correct 7 ms 344 KB Output is correct
9 Correct 9 ms 344 KB Output is correct
10 Correct 6 ms 344 KB Output is correct
11 Correct 2 ms 504 KB Output is correct
12 Correct 7 ms 384 KB Output is correct
13 Correct 4 ms 344 KB Output is correct
14 Correct 9 ms 344 KB Output is correct
15 Correct 6 ms 436 KB Output is correct
16 Correct 8 ms 344 KB Output is correct
17 Correct 7 ms 344 KB Output is correct
18 Correct 3 ms 344 KB Output is correct
19 Correct 3 ms 344 KB Output is correct
20 Correct 3 ms 344 KB Output is correct
21 Correct 3 ms 344 KB Output is correct
22 Correct 2 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 0 ms 344 KB Output is correct
6 Correct 14 ms 344 KB Output is correct
7 Correct 3 ms 344 KB Output is correct
8 Correct 7 ms 344 KB Output is correct
9 Correct 9 ms 344 KB Output is correct
10 Correct 6 ms 344 KB Output is correct
11 Correct 2 ms 504 KB Output is correct
12 Correct 7 ms 384 KB Output is correct
13 Correct 4 ms 344 KB Output is correct
14 Correct 9 ms 344 KB Output is correct
15 Correct 6 ms 436 KB Output is correct
16 Correct 8 ms 344 KB Output is correct
17 Correct 7 ms 344 KB Output is correct
18 Correct 3 ms 344 KB Output is correct
19 Correct 3 ms 344 KB Output is correct
20 Correct 3 ms 344 KB Output is correct
21 Correct 3 ms 344 KB Output is correct
22 Correct 2 ms 344 KB Output is correct
23 Correct 93 ms 416 KB Output is correct
24 Correct 17 ms 1108 KB Output is correct
25 Correct 34 ms 344 KB Output is correct
26 Correct 28 ms 416 KB Output is correct
27 Correct 44 ms 344 KB Output is correct
28 Correct 8 ms 344 KB Output is correct
29 Correct 35 ms 340 KB Output is correct
30 Correct 23 ms 344 KB Output is correct
31 Correct 48 ms 592 KB Output is correct
32 Correct 50 ms 592 KB Output is correct
33 Correct 44 ms 344 KB Output is correct
34 Correct 34 ms 344 KB Output is correct
35 Correct 45 ms 420 KB Output is correct
36 Correct 39 ms 688 KB Output is correct
37 Correct 15 ms 344 KB Output is correct
38 Correct 22 ms 344 KB Output is correct
39 Correct 15 ms 344 KB Output is correct
40 Correct 14 ms 344 KB Output is correct
41 Correct 7 ms 596 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 340 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 Partially correct 214 ms 660 KB Output is partially correct
8 Correct 25 ms 600 KB Output is correct
9 Partially correct 79 ms 584 KB Output is partially correct
10 Partially correct 88 ms 432 KB Output is partially correct
11 Partially correct 98 ms 344 KB Output is partially correct
12 Correct 18 ms 344 KB Output is correct
13 Partially correct 73 ms 424 KB Output is partially correct
14 Partially correct 54 ms 448 KB Output is partially correct
15 Partially correct 140 ms 424 KB Output is partially correct
16 Partially correct 123 ms 672 KB Output is partially correct
17 Partially correct 98 ms 684 KB Output is partially correct
18 Partially correct 121 ms 676 KB Output is partially correct
19 Partially correct 109 ms 908 KB Output is partially correct
20 Partially correct 110 ms 924 KB Output is partially correct
21 Partially correct 81 ms 432 KB Output is partially correct
22 Partially correct 58 ms 344 KB Output is partially correct
23 Partially correct 35 ms 444 KB Output is partially correct
24 Correct 30 ms 600 KB Output is correct
25 Correct 24 ms 600 KB Output is correct
26 Correct 22 ms 444 KB Output is correct
27 Partially correct 93 ms 676 KB Output is partially correct
28 Partially correct 103 ms 928 KB Output is partially correct
29 Partially correct 105 ms 592 KB Output is partially correct
30 Partially correct 129 ms 600 KB Output is partially correct
31 Partially correct 70 ms 428 KB Output is partially correct
32 Partially correct 51 ms 428 KB Output is partially correct
33 Partially correct 36 ms 344 KB Output is partially correct
34 Partially correct 54 ms 600 KB Output is partially correct
35 Partially correct 80 ms 440 KB Output is partially correct
36 Partially correct 93 ms 840 KB Output is partially correct
37 Partially correct 79 ms 688 KB Output is partially correct
38 Partially correct 58 ms 432 KB Output is partially correct
39 Partially correct 58 ms 672 KB Output is partially correct
40 Partially correct 59 ms 856 KB Output is partially correct
41 Partially correct 74 ms 424 KB Output is partially correct
42 Partially correct 79 ms 596 KB Output is partially correct
43 Partially correct 13 ms 344 KB Output is partially correct
44 Partially correct 69 ms 344 KB Output is partially correct
45 Partially correct 199 ms 880 KB Output is partially correct
46 Correct 36 ms 344 KB Output is correct
47 Correct 27 ms 436 KB Output is correct
48 Correct 23 ms 436 KB Output is correct