Submission #838698

# Submission time Handle Problem Language Result Execution time Memory
838698 2023-08-27T15:25:12 Z taher Rarest Insects (IOI22_insects) C++17
47.52 / 100
133 ms 544 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() == 1) {
    return n; 
  }
  
  auto get_low_bound = [&]() {
    for (int i = 0; i < n; i++) {
      if (in[i]) {
        continue; 
      }
      move_inside(i); 
    }
    int big = press_button();
    for (int i = 0; i < n; i++) {
      if (in[i]) {
        continue; 
      }
      move_outside(i); 
    }
    
    int low = 1, high = n / (int) roots.size();
    
    auto Can = [&](int mid) {
      int restant = n - mid;
      if ((restant + (int) roots.size() - 2) / ((int) roots.size() - 1) > big) {
        return false; 
      }
      return true;
    };
    
    while (low <= high) {
      int mid = low + (high - low) / 2;
      if (Can(mid)) {
        high = mid - 1;
      } else {
        low = mid + 1; 
      } 
    }
    ++high;
    return high;
  };
  
  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 = get_low_bound();
  int 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;
}
# Verdict Execution time Memory 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 2 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 8 ms 208 KB Output is correct
9 Correct 6 ms 208 KB Output is correct
10 Correct 11 ms 208 KB Output is correct
11 Correct 4 ms 208 KB Output is correct
12 Correct 8 ms 208 KB Output is correct
13 Correct 5 ms 208 KB Output is correct
14 Correct 8 ms 208 KB Output is correct
15 Correct 8 ms 304 KB Output is correct
16 Correct 6 ms 296 KB Output is correct
17 Correct 6 ms 208 KB Output is correct
18 Correct 8 ms 208 KB Output is correct
19 Correct 5 ms 300 KB Output is correct
20 Correct 3 ms 208 KB Output is correct
21 Correct 3 ms 208 KB Output is correct
22 Correct 2 ms 208 KB Output is correct
# Verdict Execution time Memory 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 2 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 8 ms 208 KB Output is correct
9 Correct 6 ms 208 KB Output is correct
10 Correct 11 ms 208 KB Output is correct
11 Correct 4 ms 208 KB Output is correct
12 Correct 8 ms 208 KB Output is correct
13 Correct 5 ms 208 KB Output is correct
14 Correct 8 ms 208 KB Output is correct
15 Correct 8 ms 304 KB Output is correct
16 Correct 6 ms 296 KB Output is correct
17 Correct 6 ms 208 KB Output is correct
18 Correct 8 ms 208 KB Output is correct
19 Correct 5 ms 300 KB Output is correct
20 Correct 3 ms 208 KB Output is correct
21 Correct 3 ms 208 KB Output is correct
22 Correct 2 ms 208 KB Output is correct
23 Correct 7 ms 208 KB Output is correct
24 Correct 8 ms 308 KB Output is correct
25 Correct 25 ms 408 KB Output is correct
26 Correct 34 ms 332 KB Output is correct
27 Correct 67 ms 284 KB Output is correct
28 Correct 11 ms 208 KB Output is correct
29 Correct 62 ms 208 KB Output is correct
30 Correct 42 ms 208 KB Output is correct
31 Correct 56 ms 292 KB Output is correct
32 Correct 45 ms 296 KB Output is correct
33 Correct 54 ms 304 KB Output is correct
34 Correct 39 ms 292 KB Output is correct
35 Correct 48 ms 284 KB Output is correct
36 Correct 51 ms 284 KB Output is correct
37 Correct 29 ms 288 KB Output is correct
38 Correct 31 ms 208 KB Output is correct
39 Correct 23 ms 208 KB Output is correct
40 Correct 9 ms 336 KB Output is correct
41 Correct 9 ms 208 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 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 228 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Partially correct 1 ms 208 KB Output is partially correct
7 Correct 15 ms 208 KB Output is correct
8 Correct 13 ms 208 KB Output is correct
9 Partially correct 82 ms 288 KB Output is partially correct
10 Partially correct 76 ms 292 KB Output is partially correct
11 Partially correct 133 ms 288 KB Output is partially correct
12 Correct 32 ms 208 KB Output is correct
13 Partially correct 103 ms 288 KB Output is partially correct
14 Partially correct 81 ms 288 KB Output is partially correct
15 Partially correct 111 ms 292 KB Output is partially correct
16 Partially correct 87 ms 544 KB Output is partially correct
17 Partially correct 105 ms 304 KB Output is partially correct
18 Partially correct 99 ms 356 KB Output is partially correct
19 Partially correct 109 ms 320 KB Output is partially correct
20 Partially correct 101 ms 412 KB Output is partially correct
21 Partially correct 81 ms 396 KB Output is partially correct
22 Partially correct 41 ms 308 KB Output is partially correct
23 Partially correct 52 ms 284 KB Output is partially correct
24 Partially correct 30 ms 308 KB Output is partially correct
25 Correct 25 ms 300 KB Output is correct
26 Correct 17 ms 208 KB Output is correct
27 Correct 24 ms 292 KB Output is correct
28 Correct 20 ms 288 KB Output is correct
29 Partially correct 82 ms 304 KB Output is partially correct
30 Partially correct 62 ms 300 KB Output is partially correct
31 Partially correct 82 ms 296 KB Output is partially correct
32 Partially correct 85 ms 300 KB Output is partially correct
33 Partially correct 47 ms 316 KB Output is partially correct
34 Partially correct 52 ms 308 KB Output is partially correct
35 Partially correct 32 ms 292 KB Output is partially correct
36 Partially correct 38 ms 304 KB Output is partially correct
37 Partially correct 70 ms 424 KB Output is partially correct
38 Partially correct 79 ms 300 KB Output is partially correct
39 Partially correct 52 ms 288 KB Output is partially correct
40 Partially correct 56 ms 288 KB Output is partially correct
41 Partially correct 31 ms 300 KB Output is partially correct
42 Partially correct 63 ms 284 KB Output is partially correct
43 Partially correct 23 ms 300 KB Output is partially correct
44 Partially correct 97 ms 292 KB Output is partially correct
45 Correct 30 ms 540 KB Output is correct
46 Correct 32 ms 308 KB Output is correct
47 Correct 28 ms 208 KB Output is correct
48 Correct 16 ms 312 KB Output is correct