답안 #1009130

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1009130 2024-06-27T09:10:41 Z oyber 드문 곤충 (IOI22_insects) C++17
47.5 / 100
184 ms 1096 KB
#include "insects.h"
#include <bits/stdc++.h>
using namespace std;

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

bool check_num(int num) {
  //printf("num: %d\n", num);
  vector<bool> used(N, false);
  for (int i = 0; i < int(insects.size()); i++) {
    //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]);
  }

  for (int i = 0; i < N; i++) {
    if (used[i]) {
      move_outside(i);
    }
  }
  //printf("valid: %d\n", int(valid));
  return valid;
}

int min_cardinality(int n) {
  N = 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+1;
  while (l < r) {
    int m = (l+r)/2;
    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;*/
}
# 결과 실행 시간 메모리 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 9 ms 344 KB Output is correct
7 Correct 3 ms 344 KB Output is correct
8 Correct 12 ms 344 KB Output is correct
9 Correct 8 ms 344 KB Output is correct
10 Correct 7 ms 348 KB Output is correct
11 Correct 7 ms 344 KB Output is correct
12 Correct 8 ms 344 KB Output is correct
13 Correct 10 ms 344 KB Output is correct
14 Correct 8 ms 348 KB Output is correct
15 Correct 8 ms 344 KB Output is correct
16 Correct 8 ms 432 KB Output is correct
17 Correct 8 ms 344 KB Output is correct
18 Correct 8 ms 344 KB Output is correct
19 Correct 8 ms 444 KB Output is correct
20 Correct 9 ms 344 KB Output is correct
21 Correct 6 ms 344 KB Output is correct
22 Correct 6 ms 348 KB Output is correct
# 결과 실행 시간 메모리 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 9 ms 344 KB Output is correct
7 Correct 3 ms 344 KB Output is correct
8 Correct 12 ms 344 KB Output is correct
9 Correct 8 ms 344 KB Output is correct
10 Correct 7 ms 348 KB Output is correct
11 Correct 7 ms 344 KB Output is correct
12 Correct 8 ms 344 KB Output is correct
13 Correct 10 ms 344 KB Output is correct
14 Correct 8 ms 348 KB Output is correct
15 Correct 8 ms 344 KB Output is correct
16 Correct 8 ms 432 KB Output is correct
17 Correct 8 ms 344 KB Output is correct
18 Correct 8 ms 344 KB Output is correct
19 Correct 8 ms 444 KB Output is correct
20 Correct 9 ms 344 KB Output is correct
21 Correct 6 ms 344 KB Output is correct
22 Correct 6 ms 348 KB Output is correct
23 Correct 66 ms 600 KB Output is correct
24 Correct 10 ms 344 KB Output is correct
25 Correct 62 ms 344 KB Output is correct
26 Correct 56 ms 416 KB Output is correct
27 Correct 69 ms 344 KB Output is correct
28 Correct 40 ms 344 KB Output is correct
29 Correct 77 ms 600 KB Output is correct
30 Correct 53 ms 344 KB Output is correct
31 Correct 71 ms 420 KB Output is correct
32 Correct 74 ms 344 KB Output is correct
33 Correct 63 ms 344 KB Output is correct
34 Correct 59 ms 344 KB Output is correct
35 Correct 63 ms 440 KB Output is correct
36 Correct 53 ms 600 KB Output is correct
37 Correct 56 ms 592 KB Output is correct
38 Correct 59 ms 344 KB Output is correct
39 Correct 55 ms 344 KB Output is correct
40 Correct 32 ms 344 KB Output is correct
41 Correct 29 ms 344 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 356 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 Partially correct 0 ms 344 KB Output is partially correct
6 Partially correct 0 ms 344 KB Output is partially correct
7 Partially correct 119 ms 896 KB Output is partially correct
8 Correct 18 ms 344 KB Output is correct
9 Partially correct 133 ms 684 KB Output is partially correct
10 Partially correct 162 ms 904 KB Output is partially correct
11 Partially correct 184 ms 692 KB Output is partially correct
12 Partially correct 88 ms 1096 KB Output is partially correct
13 Partially correct 121 ms 344 KB Output is partially correct
14 Partially correct 132 ms 668 KB Output is partially correct
15 Partially correct 127 ms 672 KB Output is partially correct
16 Partially correct 136 ms 892 KB Output is partially correct
17 Partially correct 120 ms 444 KB Output is partially correct
18 Partially correct 164 ms 672 KB Output is partially correct
19 Partially correct 117 ms 924 KB Output is partially correct
20 Partially correct 136 ms 856 KB Output is partially correct
21 Partially correct 144 ms 908 KB Output is partially correct
22 Partially correct 129 ms 452 KB Output is partially correct
23 Partially correct 127 ms 656 KB Output is partially correct
24 Partially correct 112 ms 680 KB Output is partially correct
25 Partially correct 74 ms 440 KB Output is partially correct
26 Partially correct 87 ms 440 KB Output is partially correct
27 Partially correct 135 ms 680 KB Output is partially correct
28 Partially correct 125 ms 676 KB Output is partially correct
29 Partially correct 109 ms 672 KB Output is partially correct
30 Partially correct 143 ms 1048 KB Output is partially correct
31 Partially correct 139 ms 428 KB Output is partially correct
32 Partially correct 138 ms 948 KB Output is partially correct
33 Partially correct 145 ms 448 KB Output is partially correct
34 Partially correct 137 ms 680 KB Output is partially correct
35 Partially correct 121 ms 656 KB Output is partially correct
36 Partially correct 159 ms 856 KB Output is partially correct
37 Partially correct 127 ms 928 KB Output is partially correct
38 Partially correct 145 ms 440 KB Output is partially correct
39 Partially correct 137 ms 668 KB Output is partially correct
40 Partially correct 105 ms 664 KB Output is partially correct
41 Partially correct 108 ms 668 KB Output is partially correct
42 Partially correct 137 ms 672 KB Output is partially correct
43 Partially correct 26 ms 436 KB Output is partially correct
44 Partially correct 90 ms 424 KB Output is partially correct
45 Partially correct 124 ms 600 KB Output is partially correct
46 Partially correct 97 ms 420 KB Output is partially correct
47 Partially correct 105 ms 600 KB Output is partially correct
48 Partially correct 110 ms 344 KB Output is partially correct