oj.uz

Submission #838717

# Submission time Handle Problem Language Result Execution time Memory
838717 2023-08-27T15:59:24 Z taher Rarest Insects (IOI22_insects) C++17
57.28 / 100
 110 ms 428 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; 
  }
  
  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;  
  }  
  
  int base = (int) roots.size();
 
  auto Check = [&](int mid) {
    vector<int> tmp;
    for (int i = 0; i < n; i++) {
      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; 
    }
    for (int i = 0; i < (int) tmp.size(); i++) {
      roots.pop_back(); 
      in[tmp[i]] = false;
      move_outside(tmp[i]);
    }
    return false;
  };
  
  int low = 2;
  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 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 1 ms 208 KB Output is correct
5 Correct 0 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 5 ms 300 KB Output is correct
9 Correct 6 ms 296 KB Output is correct
10 Correct 4 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 10 ms 208 KB Output is correct
13 Correct 5 ms 208 KB Output is correct
14 Correct 7 ms 208 KB Output is correct
15 Correct 4 ms 208 KB Output is correct
16 Correct 3 ms 208 KB Output is correct
17 Correct 6 ms 208 KB Output is correct
18 Correct 6 ms 296 KB Output is correct
19 Correct 5 ms 300 KB Output is correct
20 Correct 3 ms 208 KB Output is correct
21 Correct 2 ms 208 KB Output is correct
22 Correct 1 ms 208 KB Output is correct

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

Subtask #3
32.28 / 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 0 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 16 ms 208 KB Output is correct
8 Correct 7 ms 312 KB Output is correct
9 Correct 43 ms 300 KB Output is correct
10 Partially correct 42 ms 308 KB Output is partially correct
11 Correct 38 ms 208 KB Output is correct
12 Correct 18 ms 308 KB Output is correct
13 Partially correct 82 ms 208 KB Output is partially correct
14 Partially correct 77 ms 284 KB Output is partially correct
15 Partially correct 78 ms 208 KB Output is partially correct
16 Partially correct 49 ms 296 KB Output is partially correct
17 Partially correct 35 ms 288 KB Output is partially correct
18 Partially correct 27 ms 300 KB Output is partially correct
19 Partially correct 47 ms 284 KB Output is partially correct
20 Partially correct 32 ms 296 KB Output is partially correct
21 Partially correct 33 ms 312 KB Output is partially correct
22 Partially correct 64 ms 332 KB Output is partially correct
23 Partially correct 40 ms 208 KB Output is partially correct
24 Correct 27 ms 336 KB Output is correct
25 Correct 19 ms 208 KB Output is correct
26 Correct 13 ms 312 KB Output is correct
27 Correct 38 ms 428 KB Output is correct
28 Correct 42 ms 308 KB Output is correct
29 Partially correct 33 ms 308 KB Output is partially correct
30 Partially correct 33 ms 304 KB Output is partially correct
31 Partially correct 49 ms 208 KB Output is partially correct
32 Partially correct 45 ms 304 KB Output is partially correct
33 Partially correct 60 ms 208 KB Output is partially correct
34 Partially correct 79 ms 288 KB Output is partially correct
35 Partially correct 38 ms 300 KB Output is partially correct
36 Partially correct 44 ms 296 KB Output is partially correct
37 Partially correct 49 ms 304 KB Output is partially correct
38 Partially correct 56 ms 304 KB Output is partially correct
39 Correct 32 ms 420 KB Output is correct
40 Correct 40 ms 288 KB Output is correct
41 Partially correct 33 ms 300 KB Output is partially correct
42 Partially correct 21 ms 304 KB Output is partially correct
43 Partially correct 25 ms 208 KB Output is partially correct
44 Partially correct 110 ms 208 KB Output is partially correct
45 Correct 34 ms 208 KB Output is correct
46 Correct 17 ms 292 KB Output is correct
47 Correct 16 ms 208 KB Output is correct
48 Correct 19 ms 300 KB Output is correct