oj.uz

Submission #838804

# Submission time Handle Problem Language Result Execution time Memory
838804 2023-08-27T18:45:44 Z taher Rarest Insects (IOI22_insects) C++17
100 / 100
 53 ms 456 KB 
#include "insects.h"
#include <bits/stdc++.h>

using namespace std;

mt19937 rng((unsigned int) chrono::steady_clock::now().time_since_epoch().count());

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; 
  }
  
  int base = (int) roots.size();
  vector<int> possible;
  for (int i = 0; i < n; i++) {
    possible.push_back(i); 
  }
  
  vector<int> max_value(n);
  vector<int> min_value(n, 1234567);
 
  auto Check = [&](int mid) {
    vector<int> tmp;
    for (int id = 0; id < (int) possible.size(); id++) {
      int i = possible[id];
      if (in[i] || max_value[i] > mid) {
        continue; 
      }
      move_inside(i);
      
      if (min_value[i] < mid) {
        tmp.push_back(i);
        roots.push_back(i);
        in[i] = true; 
      } else {
        if (press_button() > mid) {
          max_value[i] = max(max_value[i], mid);
          move_outside(i);
        } else {
          min_value[i] = min(min_value[i], mid);
          tmp.push_back(i);
          roots.push_back(i);
          in[i] = true;
        }
      }
    }
    if ((int) roots.size() == base * mid) {
      sort(roots.begin(), roots.end());
      return true;
    }
    possible = roots;
    for (int i = 0; i < (int) tmp.size(); i++) {
      roots.pop_back(); 
      in[tmp[i]] = false;
      move_outside(tmp[i]);
    }
    sort(roots.begin(), roots.end());
    sort(possible.begin(), possible.end());
    return false;
  };
  
  int low = 2;
  int high = n / (int) roots.size();
  
  while (low <= high) {
    int mid = low + (high - low) / 2;
    if (rng() % 2 == 1 && mid < high) {
      ++mid; 
    }
    
    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 1 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 3 ms 208 KB Output is correct
7 Correct 2 ms 308 KB Output is correct
8 Correct 5 ms 300 KB Output is correct
9 Correct 8 ms 300 KB Output is correct
10 Correct 4 ms 208 KB Output is correct
11 Correct 2 ms 308 KB Output is correct
12 Correct 5 ms 304 KB Output is correct
13 Correct 4 ms 300 KB Output is correct
14 Correct 5 ms 208 KB Output is correct
15 Correct 3 ms 208 KB Output is correct
16 Correct 5 ms 300 KB Output is correct
17 Correct 5 ms 300 KB Output is correct
18 Correct 5 ms 304 KB Output is correct
19 Correct 5 ms 208 KB Output is correct
20 Correct 6 ms 208 KB Output is correct
21 Correct 2 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 1 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 3 ms 208 KB Output is correct
7 Correct 2 ms 308 KB Output is correct
8 Correct 5 ms 300 KB Output is correct
9 Correct 8 ms 300 KB Output is correct
10 Correct 4 ms 208 KB Output is correct
11 Correct 2 ms 308 KB Output is correct
12 Correct 5 ms 304 KB Output is correct
13 Correct 4 ms 300 KB Output is correct
14 Correct 5 ms 208 KB Output is correct
15 Correct 3 ms 208 KB Output is correct
16 Correct 5 ms 300 KB Output is correct
17 Correct 5 ms 300 KB Output is correct
18 Correct 5 ms 304 KB Output is correct
19 Correct 5 ms 208 KB Output is correct
20 Correct 6 ms 208 KB Output is correct
21 Correct 2 ms 208 KB Output is correct
22 Correct 2 ms 208 KB Output is correct
23 Correct 9 ms 208 KB Output is correct
24 Correct 6 ms 312 KB Output is correct
25 Correct 16 ms 324 KB Output is correct
26 Correct 24 ms 304 KB Output is correct
27 Correct 32 ms 292 KB Output is correct
28 Correct 7 ms 308 KB Output is correct
29 Correct 17 ms 300 KB Output is correct
30 Correct 19 ms 304 KB Output is correct
31 Correct 18 ms 208 KB Output is correct
32 Correct 19 ms 304 KB Output is correct
33 Correct 23 ms 312 KB Output is correct
34 Correct 25 ms 208 KB Output is correct
35 Correct 22 ms 208 KB Output is correct
36 Correct 22 ms 308 KB Output is correct
37 Correct 19 ms 308 KB Output is correct
38 Correct 27 ms 292 KB Output is correct
39 Correct 15 ms 208 KB Output is correct
40 Correct 13 ms 308 KB Output is correct
41 Correct 7 ms 308 KB Output is correct

Subtask #3
75.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 Correct 1 ms 208 KB Output is correct
7 Correct 17 ms 208 KB Output is correct
8 Correct 14 ms 316 KB Output is correct
9 Correct 41 ms 300 KB Output is correct
10 Correct 41 ms 292 KB Output is correct
11 Correct 47 ms 300 KB Output is correct
12 Correct 25 ms 308 KB Output is correct
13 Correct 36 ms 304 KB Output is correct
14 Correct 44 ms 424 KB Output is correct
15 Correct 35 ms 300 KB Output is correct
16 Correct 21 ms 344 KB Output is correct
17 Correct 39 ms 328 KB Output is correct
18 Correct 50 ms 328 KB Output is correct
19 Correct 39 ms 292 KB Output is correct
20 Correct 37 ms 288 KB Output is correct
21 Correct 38 ms 328 KB Output is correct
22 Correct 37 ms 336 KB Output is correct
23 Correct 32 ms 328 KB Output is correct
24 Correct 30 ms 308 KB Output is correct
25 Correct 20 ms 316 KB Output is correct
26 Correct 14 ms 316 KB Output is correct
27 Correct 23 ms 304 KB Output is correct
28 Correct 29 ms 304 KB Output is correct
29 Correct 38 ms 328 KB Output is correct
30 Correct 41 ms 308 KB Output is correct
31 Correct 51 ms 340 KB Output is correct
32 Correct 52 ms 304 KB Output is correct
33 Correct 23 ms 420 KB Output is correct
34 Correct 36 ms 324 KB Output is correct
35 Correct 53 ms 300 KB Output is correct
36 Correct 37 ms 328 KB Output is correct
37 Correct 37 ms 336 KB Output is correct
38 Correct 38 ms 308 KB Output is correct
39 Correct 43 ms 300 KB Output is correct
40 Correct 32 ms 300 KB Output is correct
41 Correct 32 ms 332 KB Output is correct
42 Correct 24 ms 456 KB Output is correct
43 Correct 12 ms 304 KB Output is correct
44 Correct 30 ms 304 KB Output is correct
45 Correct 39 ms 332 KB Output is correct
46 Correct 22 ms 308 KB Output is correct
47 Correct 27 ms 316 KB Output is correct
48 Correct 26 ms 304 KB Output is correct