답안 #838677

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
838677 2023-08-27T14:56:48 Z taher 드문 곤충 (IOI22_insects) C++17
57.28 / 100
121 ms 456 KB
#include "insects.h"
#include <bits/stdc++.h>

using namespace std;

int min_cardinality(int N) {
  int n = N;
  vector<int> in(n);
  
  vector<int> roots;
  for (int i = 0; i < n; i++) {
    move_inside(i);
    if (press_button() == 2) {
      move_outside(i); 
    } else {
      roots.push_back(i);
      in[i] = true; 
    }
  }
  assert((int) roots.size() > 0);
  
  if ((int) roots.size() <= 5) {
    int res = 1234567;
    
    for (int i = 0; i < (int) roots.size(); i++) {
      move_outside(roots[i]); 
    }
    for (int it = 0; it < (int) roots.size(); it++) {
      move_inside(roots[it]);
      int cnt = 1;
      
      for (int j = 0; j < n; j++) {
        if (j == roots[it]) {
          continue; 
        }
        
        move_inside(j);
        if (press_button() == 2) {
          cnt++; 
        }
        move_outside(j);
      }
      
      res = min(res, cnt);
      move_outside(roots[it]); 
    }
    return res;  
  }
  
  
  auto Check = [&](int mid) {
    vector<int> cnt;
    for (int i = 0; i < n; i++) {
      if (in[i]) {
        continue; 
      }
      move_inside(i);
      if (press_button() > mid) {
        move_outside(i);
      } else {
        cnt.push_back(i);
      } 
    }
    for (int i = 0; i < (int) cnt.size(); i++) {
      move_outside(cnt[i]); 
    }
    if ((int) cnt.size() == (mid - 1) * (int) roots.size()) {
      return true; 
    }
    return false;
  };
  
  int low = 1, high = n / (int) roots.size();
  
  while (low <= high) {
    int mid = low + (high - low) / 2;
    
    if (Check(mid)) {
      low = mid + 1;
    } else  {
      high = mid - 1; 
    } 
  }
  --low;
  return low;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 4 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 8 ms 208 KB Output is correct
9 Correct 7 ms 208 KB Output is correct
10 Correct 5 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 9 ms 208 KB Output is correct
13 Correct 6 ms 208 KB Output is correct
14 Correct 5 ms 208 KB Output is correct
15 Correct 9 ms 208 KB Output is correct
16 Correct 9 ms 208 KB Output is correct
17 Correct 8 ms 300 KB Output is correct
18 Correct 4 ms 332 KB Output is correct
19 Correct 3 ms 300 KB Output is correct
20 Correct 5 ms 208 KB Output is correct
21 Correct 4 ms 208 KB Output is correct
22 Correct 3 ms 208 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 4 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 8 ms 208 KB Output is correct
9 Correct 7 ms 208 KB Output is correct
10 Correct 5 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 9 ms 208 KB Output is correct
13 Correct 6 ms 208 KB Output is correct
14 Correct 5 ms 208 KB Output is correct
15 Correct 9 ms 208 KB Output is correct
16 Correct 9 ms 208 KB Output is correct
17 Correct 8 ms 300 KB Output is correct
18 Correct 4 ms 332 KB Output is correct
19 Correct 3 ms 300 KB Output is correct
20 Correct 5 ms 208 KB Output is correct
21 Correct 4 ms 208 KB Output is correct
22 Correct 3 ms 208 KB Output is correct
23 Correct 17 ms 208 KB Output is correct
24 Correct 7 ms 208 KB Output is correct
25 Correct 56 ms 288 KB Output is correct
26 Correct 52 ms 288 KB Output is correct
27 Correct 27 ms 208 KB Output is correct
28 Correct 9 ms 208 KB Output is correct
29 Correct 33 ms 208 KB Output is correct
30 Correct 42 ms 256 KB Output is correct
31 Correct 50 ms 208 KB Output is correct
32 Correct 47 ms 296 KB Output is correct
33 Correct 33 ms 456 KB Output is correct
34 Correct 70 ms 292 KB Output is correct
35 Correct 61 ms 300 KB Output is correct
36 Correct 44 ms 208 KB Output is correct
37 Correct 25 ms 208 KB Output is correct
38 Correct 31 ms 208 KB Output is correct
39 Correct 25 ms 208 KB Output is correct
40 Correct 19 ms 284 KB Output is correct
41 Correct 11 ms 312 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 29 ms 208 KB Output is correct
8 Correct 12 ms 316 KB Output is correct
9 Partially correct 86 ms 300 KB Output is partially correct
10 Partially correct 94 ms 300 KB Output is partially correct
11 Correct 43 ms 208 KB Output is correct
12 Correct 25 ms 208 KB Output is correct
13 Partially correct 69 ms 208 KB Output is partially correct
14 Partially correct 75 ms 208 KB Output is partially correct
15 Partially correct 68 ms 208 KB Output is partially correct
16 Partially correct 121 ms 304 KB Output is partially correct
17 Partially correct 76 ms 304 KB Output is partially correct
18 Partially correct 91 ms 308 KB Output is partially correct
19 Partially correct 110 ms 320 KB Output is partially correct
20 Partially correct 86 ms 292 KB Output is partially correct
21 Partially correct 62 ms 424 KB Output is partially correct
22 Partially correct 52 ms 416 KB Output is partially correct
23 Partially correct 55 ms 208 KB Output is partially correct
24 Correct 32 ms 208 KB Output is correct
25 Correct 19 ms 260 KB Output is correct
26 Correct 18 ms 208 KB Output is correct
27 Partially correct 93 ms 328 KB Output is partially correct
28 Partially correct 74 ms 332 KB Output is partially correct
29 Partially correct 101 ms 300 KB Output is partially correct
30 Partially correct 54 ms 316 KB Output is partially correct
31 Partially correct 75 ms 304 KB Output is partially correct
32 Partially correct 77 ms 300 KB Output is partially correct
33 Partially correct 57 ms 208 KB Output is partially correct
34 Partially correct 55 ms 328 KB Output is partially correct
35 Partially correct 89 ms 300 KB Output is partially correct
36 Partially correct 67 ms 308 KB Output is partially correct
37 Partially correct 77 ms 304 KB Output is partially correct
38 Partially correct 72 ms 312 KB Output is partially correct
39 Partially correct 72 ms 308 KB Output is partially correct
40 Partially correct 79 ms 304 KB Output is partially correct
41 Partially correct 88 ms 292 KB Output is partially correct
42 Partially correct 79 ms 436 KB Output is partially correct
43 Partially correct 25 ms 208 KB Output is partially correct
44 Partially correct 104 ms 208 KB Output is partially correct
45 Correct 35 ms 208 KB Output is correct
46 Correct 26 ms 316 KB Output is correct
47 Correct 25 ms 308 KB Output is correct
48 Correct 22 ms 208 KB Output is correct