oj.uz

Submission #838740

# Submission time Handle Problem Language Result Execution time Memory
838740 2023-08-27T16:24:07 Z taher Rarest Insects (IOI22_insects) C++17
95.34 / 100
 54 ms 424 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;
  };
  
  int base = (int) roots.size();
  vector<int> possible;
  for (int i = 0; i < n; i++) {
    possible.push_back(i); 
  }
 
  auto Check = [&](int mid) {
    vector<int> tmp;
    for (int id = 0; id < (int) possible.size(); id++) {
      int i = possible[id];
      if (in[i]) {
        continue; 
      }
      move_inside(i);
      if (press_button() > mid) {
        move_outside(i);
      } else {
        tmp.push_back(i);
        roots.push_back(i);
        in[i] = true;
      } 
    }
    if ((int) roots.size() == base * mid) {
      return true;
    }
    possible = roots;
    for (int i = 0; i < (int) tmp.size(); i++) {
      roots.pop_back(); 
      in[tmp[i]] = false;
      move_outside(tmp[i]);
    }
    return false;
  };
  
  int low = max(2, 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;
}

Subtask #1
10.0 / 10.0

# 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 1 ms 208 KB Output is correct
4 Correct 1 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 3 ms 208 KB Output is correct
9 Correct 3 ms 300 KB Output is correct
10 Correct 3 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 4 ms 300 KB Output is correct
13 Correct 4 ms 208 KB Output is correct
14 Correct 4 ms 208 KB Output is correct
15 Correct 4 ms 208 KB Output is correct
16 Correct 4 ms 208 KB Output is correct
17 Correct 4 ms 300 KB Output is correct
18 Correct 5 ms 300 KB Output is correct
19 Correct 5 ms 296 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

Subtask #2
15.0 / 15.0

# 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 1 ms 208 KB Output is correct
4 Correct 1 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 3 ms 208 KB Output is correct
9 Correct 3 ms 300 KB Output is correct
10 Correct 3 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 4 ms 300 KB Output is correct
13 Correct 4 ms 208 KB Output is correct
14 Correct 4 ms 208 KB Output is correct
15 Correct 4 ms 208 KB Output is correct
16 Correct 4 ms 208 KB Output is correct
17 Correct 4 ms 300 KB Output is correct
18 Correct 5 ms 300 KB Output is correct
19 Correct 5 ms 296 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 5 ms 208 KB Output is correct
24 Correct 7 ms 288 KB Output is correct
25 Correct 22 ms 284 KB Output is correct
26 Correct 19 ms 304 KB Output is correct
27 Correct 23 ms 304 KB Output is correct
28 Correct 9 ms 208 KB Output is correct
29 Correct 22 ms 304 KB Output is correct
30 Correct 19 ms 208 KB Output is correct
31 Correct 20 ms 304 KB Output is correct
32 Correct 16 ms 308 KB Output is correct
33 Correct 34 ms 296 KB Output is correct
34 Correct 27 ms 292 KB Output is correct
35 Correct 19 ms 288 KB Output is correct
36 Correct 19 ms 304 KB Output is correct
37 Correct 21 ms 280 KB Output is correct
38 Correct 21 ms 300 KB Output is correct
39 Correct 19 ms 312 KB Output is correct
40 Correct 6 ms 208 KB Output is correct
41 Correct 7 ms 304 KB Output is correct

Subtask #3
70.34 / 75.0

# 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 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 1 ms 208 KB Output is correct
7 Correct 7 ms 208 KB Output is correct
8 Correct 9 ms 312 KB Output is correct
9 Partially correct 33 ms 284 KB Output is partially correct
10 Partially correct 31 ms 316 KB Output is partially correct
11 Partially correct 27 ms 300 KB Output is partially correct
12 Correct 26 ms 312 KB Output is correct
13 Partially correct 36 ms 288 KB Output is partially correct
14 Partially correct 35 ms 288 KB Output is partially correct
15 Partially correct 35 ms 304 KB Output is partially correct
16 Partially correct 54 ms 288 KB Output is partially correct
17 Partially correct 25 ms 308 KB Output is partially correct
18 Partially correct 47 ms 316 KB Output is partially correct
19 Partially correct 53 ms 312 KB Output is partially correct
20 Partially correct 47 ms 288 KB Output is partially correct
21 Partially correct 40 ms 316 KB Output is partially correct
22 Partially correct 28 ms 308 KB Output is partially correct
23 Partially correct 37 ms 412 KB Output is partially correct
24 Correct 41 ms 304 KB Output is correct
25 Correct 23 ms 308 KB Output is correct
26 Correct 7 ms 304 KB Output is correct
27 Correct 27 ms 304 KB Output is correct
28 Correct 19 ms 284 KB Output is correct
29 Partially correct 44 ms 424 KB Output is partially correct
30 Partially correct 44 ms 284 KB Output is partially correct
31 Partially correct 20 ms 300 KB Output is partially correct
32 Partially correct 28 ms 312 KB Output is partially correct
33 Partially correct 45 ms 308 KB Output is partially correct
34 Partially correct 45 ms 316 KB Output is partially correct
35 Correct 21 ms 300 KB Output is correct
36 Correct 30 ms 300 KB Output is correct
37 Partially correct 51 ms 288 KB Output is partially correct
38 Partially correct 45 ms 316 KB Output is partially correct
39 Partially correct 36 ms 396 KB Output is partially correct
40 Partially correct 38 ms 288 KB Output is partially correct
41 Partially correct 36 ms 316 KB Output is partially correct
42 Partially correct 39 ms 316 KB Output is partially correct
43 Partially correct 11 ms 300 KB Output is partially correct
44 Partially correct 38 ms 296 KB Output is partially correct
45 Correct 26 ms 308 KB Output is correct
46 Correct 20 ms 284 KB Output is correct
47 Correct 26 ms 304 KB Output is correct
48 Correct 17 ms 316 KB Output is correct