oj.uz

Submission #838700

# Submission time Handle Problem Language Result Execution time Memory
838700 2023-08-27T15:27:21 Z taher Rarest Insects (IOI22_insects) C++17
25 / 100
 109 ms 420 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 = min(low + (1 << 7), 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 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 260 KB Output is correct
8 Correct 8 ms 208 KB Output is correct
9 Correct 4 ms 208 KB Output is correct
10 Correct 11 ms 208 KB Output is correct
11 Correct 3 ms 208 KB Output is correct
12 Correct 9 ms 208 KB Output is correct
13 Correct 7 ms 208 KB Output is correct
14 Correct 8 ms 208 KB Output is correct
15 Correct 8 ms 208 KB Output is correct
16 Correct 5 ms 208 KB Output is correct
17 Correct 4 ms 208 KB Output is correct
18 Correct 4 ms 208 KB Output is correct
19 Correct 7 ms 300 KB Output is correct
20 Correct 4 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 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 1 ms 208 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 2 ms 260 KB Output is correct
8 Correct 8 ms 208 KB Output is correct
9 Correct 4 ms 208 KB Output is correct
10 Correct 11 ms 208 KB Output is correct
11 Correct 3 ms 208 KB Output is correct
12 Correct 9 ms 208 KB Output is correct
13 Correct 7 ms 208 KB Output is correct
14 Correct 8 ms 208 KB Output is correct
15 Correct 8 ms 208 KB Output is correct
16 Correct 5 ms 208 KB Output is correct
17 Correct 4 ms 208 KB Output is correct
18 Correct 4 ms 208 KB Output is correct
19 Correct 7 ms 300 KB Output is correct
20 Correct 4 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 6 ms 208 KB Output is correct
25 Correct 34 ms 208 KB Output is correct
26 Correct 41 ms 296 KB Output is correct
27 Correct 53 ms 208 KB Output is correct
28 Correct 8 ms 208 KB Output is correct
29 Correct 44 ms 208 KB Output is correct
30 Correct 33 ms 296 KB Output is correct
31 Correct 44 ms 300 KB Output is correct
32 Correct 46 ms 208 KB Output is correct
33 Correct 46 ms 208 KB Output is correct
34 Correct 50 ms 208 KB Output is correct
35 Correct 37 ms 284 KB Output is correct
36 Correct 51 ms 292 KB Output is correct
37 Correct 34 ms 420 KB Output is correct
38 Correct 29 ms 304 KB Output is correct
39 Correct 22 ms 208 KB Output is correct
40 Correct 13 ms 308 KB Output is correct
41 Correct 11 ms 208 KB Output is correct

Subtask #3
0 / 75.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 0 ms 208 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 12 ms 208 KB Output is correct
8 Correct 18 ms 208 KB Output is correct
9 Partially correct 64 ms 404 KB Output is partially correct
10 Partially correct 76 ms 300 KB Output is partially correct
11 Partially correct 104 ms 300 KB Output is partially correct
12 Correct 22 ms 316 KB Output is correct
13 Partially correct 106 ms 300 KB Output is partially correct
14 Partially correct 75 ms 304 KB Output is partially correct
15 Incorrect 109 ms 304 KB Wrong answer.
16 Halted 0 ms 0 KB -