Submission #1009290

# Submission time Handle Problem Language Result Execution time Memory
1009290 2024-06-27T10:58:21 Z oyber Rarest Insects (IOI22_insects) C++17
99.15 / 100
47 ms 856 KB
#include "insects.h"
#include <bits/stdc++.h>
using namespace std;

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

void empty() {
  for (int i = 0; i < int(last_used.size()); i++) {
    int a = last_used[i];
    move_outside(a);
    used[a] = false;
  }
}

bool check_num(int num) {
  last_used = vector<bool>(N, false);
  //printf("num: %d\n", num);
  for (int i = 0; i < N; i++) {
    if (!insects[i]) continue;
    //printf("insect: %d\n", insects[i]);
    move_inside(i);
    if (press_button() >= num) {
      move_outside(i);
      continue;
    }
    last_used[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]);
  }

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

int min_cardinality(int n) {
  N = n;
  used.resize(N);
  insects.resize(N);
  int types = 0;
  for (int i = 0; i < N; i++) {
    move_inside(i);
    if (press_button() > 1) {
      move_outside(i);
      insects[i] = true;
      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+r)/2;
    if (check_num(m)) {
      l = m+1;
      for (int i = 0; i < N; i++) {
        if (last_used[i]) {
          insects[i] = false;
        }
      }
    } else {
      r = m;
      for (int i = 0; i < N; i++) {
        if (last_used[i]) {
          move_outside(i);
        } else {
          insects[i] = false;
        }
      }
    }
  }
  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 4 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 3 ms 344 KB Output is correct
11 Correct 2 ms 348 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 4 ms 344 KB Output is correct
16 Correct 3 ms 344 KB Output is correct
17 Correct 3 ms 344 KB Output is correct
18 Correct 4 ms 344 KB Output is correct
19 Correct 2 ms 344 KB Output is correct
20 Correct 2 ms 348 KB Output is correct
21 Correct 1 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 4 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 3 ms 344 KB Output is correct
11 Correct 2 ms 348 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 4 ms 344 KB Output is correct
16 Correct 3 ms 344 KB Output is correct
17 Correct 3 ms 344 KB Output is correct
18 Correct 4 ms 344 KB Output is correct
19 Correct 2 ms 344 KB Output is correct
20 Correct 2 ms 348 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 2 ms 344 KB Output is correct
23 Correct 12 ms 344 KB Output is correct
24 Correct 8 ms 856 KB Output is correct
25 Correct 14 ms 344 KB Output is correct
26 Correct 15 ms 344 KB Output is correct
27 Correct 12 ms 344 KB Output is correct
28 Correct 7 ms 600 KB Output is correct
29 Correct 14 ms 344 KB Output is correct
30 Correct 22 ms 344 KB Output is correct
31 Correct 17 ms 344 KB Output is correct
32 Correct 17 ms 344 KB Output is correct
33 Correct 13 ms 344 KB Output is correct
34 Correct 20 ms 344 KB Output is correct
35 Correct 17 ms 344 KB Output is correct
36 Correct 14 ms 344 KB Output is correct
37 Correct 11 ms 344 KB Output is correct
38 Correct 19 ms 344 KB Output is correct
39 Correct 11 ms 600 KB Output is correct
40 Correct 11 ms 344 KB Output is correct
41 Correct 10 ms 344 KB Output is correct
# 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 0 ms 344 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 Correct 31 ms 344 KB Output is correct
8 Correct 13 ms 600 KB Output is correct
9 Correct 45 ms 344 KB Output is correct
10 Correct 39 ms 344 KB Output is correct
11 Correct 27 ms 344 KB Output is correct
12 Correct 20 ms 600 KB Output is correct
13 Correct 29 ms 344 KB Output is correct
14 Correct 34 ms 344 KB Output is correct
15 Partially correct 45 ms 340 KB Output is partially correct
16 Correct 35 ms 344 KB Output is correct
17 Partially correct 19 ms 344 KB Output is partially correct
18 Correct 29 ms 344 KB Output is correct
19 Correct 23 ms 344 KB Output is correct
20 Correct 26 ms 344 KB Output is correct
21 Partially correct 34 ms 592 KB Output is partially correct
22 Correct 19 ms 344 KB Output is correct
23 Correct 24 ms 344 KB Output is correct
24 Correct 22 ms 344 KB Output is correct
25 Correct 23 ms 344 KB Output is correct
26 Correct 20 ms 344 KB Output is correct
27 Partially correct 29 ms 344 KB Output is partially correct
28 Partially correct 35 ms 344 KB Output is partially correct
29 Partially correct 29 ms 344 KB Output is partially correct
30 Partially correct 27 ms 344 KB Output is partially correct
31 Partially correct 26 ms 344 KB Output is partially correct
32 Partially correct 34 ms 344 KB Output is partially correct
33 Correct 26 ms 344 KB Output is correct
34 Correct 33 ms 344 KB Output is correct
35 Correct 30 ms 344 KB Output is correct
36 Partially correct 37 ms 344 KB Output is partially correct
37 Partially correct 25 ms 344 KB Output is partially correct
38 Partially correct 25 ms 344 KB Output is partially correct
39 Correct 26 ms 344 KB Output is correct
40 Correct 28 ms 344 KB Output is correct
41 Partially correct 23 ms 344 KB Output is partially correct
42 Partially correct 26 ms 344 KB Output is partially correct
43 Correct 8 ms 344 KB Output is correct
44 Correct 26 ms 344 KB Output is correct
45 Correct 47 ms 344 KB Output is correct
46 Correct 22 ms 688 KB Output is correct
47 Correct 22 ms 344 KB Output is correct
48 Correct 22 ms 344 KB Output is correct